Cordial labeling pdf

Let vf 0 , vf 1 , ef 0 , and ef 1 be the number of vertices labelled 0 , the number of vertices labelled 1 , the number of edges labelled 0 and the number of edges labelled 1,respectively. Any graph which satisfies cordial labeling is known as the cordial graphs.

Will sum cordial labeling exist on some graphs not mentioned above? If no, what are the sufficient or necessary conditions for it to admit sum cordial labeling? Yet, many graphs are still unknown to admit sum cordial labeling. Example 2. Then V, E is a graph G in Figure 2. Definition 2. Then a. The vertices m1 and m2 , m2 and m3 , m3 and m4 , and, m4 and m5 are adjacent since they have common edges respectively whereas m1 and m3 , m2 and m4 , m3 and m5 , m1 and m5 , m1 and m4 , and, m2 and m5 are not adjacent since they dont have common edges respectively.

On the other hand, vertices m1 and m2 , m2 and m3 , m3 and m4 , and, m4 and m5 are incident to edge n1 , n2 , n3 , and n4 respectively. And clearly these edges connects the vertices of G in Figure 2. The Path Pn is a graph with vertices v1 , v2 , v3 ,. Figure 2. A graph is simple if its edges dont have the same end vertices or if its edges is not in the form uu, where u is a vertex, otherwise, it is not simple.

Consider the graphs in Figure 2. On the contrary, the graph in Figure 2. A graph is connected if every two vertices is joined by a path, otherwise, it is disconnected. Let M and N be a graph. Publication Type. More Filters. Further results on product cordial graphs. SOCO Product cordial labeling is a binary vertex labeling with vertex condition is absolute value from difference the number of vertex having labels 0 and the number of vertex having labels 1 less or … Expand.

View 1 excerpt, cites background. Some product cordial graphs. Introduction We begin with simple, finite, connected and undirected graph , G p q with order p and size q. Throughout this work V and E respectively denote the vertex set and edge set of G. For … Expand. Highly Influenced. View 3 excerpts, cites background. In … Expand. We also discuss vertex product cordial … Expand. To browse Academia. Log in with Facebook Log in with Google. Remember me on this computer. Enter the email address you signed up with and we'll email you a reset link.

Need an account? Click here to sign up. Download Free PDF. Kailas Kanani. A short summary of this paper. Kanani , M. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

SIAM J. Algebraic Discret. View 2 excerpts, references background. Cordial labeling of hypertrees. Highly Influential. View 6 excerpts, references background and methods. The computational complexity of cordial and equitable labelling. Antimagic vertex labelings of hypergraphs. Hartsfield and Ringel J.

A-cordial graphs.