Year: 2024
Type: article
Abstract: Let = is an algebraic network model of the Cayley graph. A binary coding edge function : L(????) , it induces as ( = ). The function is said to be an edge cordial function of , if the difference between the number of vertices (edges) labeled by zero and the number of vertices (edges) labeled by one is at most one. In this paper, we show the edge binary coding of the Cayley graph network model which satisfies the edge cordial constraint.
Author: R. Radha, N. Mohamed Rilwan
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4413521817