Topological Cordial Labeling of Some Graphs


  • G. Siva Prijith Research Scholar, GVN College
  • M. Subbulakshmi
  • S. Chandrakala



Topological cordial graph, coconut tree, cycle, semi - Udukkai graph, graph operations


A topological cordial labeling of a graph G = (V(G), E(G)) with |V(G)| = n is an injective function f :V(G) →2X where X is any non – empty set such that |X| < n and {f(V(G))} forms a topology on X, that induces a function f*: E(G) →{0,1} defined by f*(uv) = 1 if f(u)∩f(v) is not an empty set and not a singleton set and 0 otherwise for all uv ϵ E(G) such that |ef (0) – ef (1)| ≤ 1, where ef (0) = number of edges labelled with 0 and ef (1) = number of edges labelled with 1. The graph which admits a topological cordial labeling is called a topological cordial graph. In this paper, topological cordial labeling of some special graphs are discussed.


Acharya B.D., Set valuations and their applications, MRI Lecture note in Applied Mathematics, No.2, Mehta Research Institute of Mathematics and Mathematical Physics, 1983.

Bondy J.A and Murthy U.S.R, “Graph Theory and Application” (North Holland). New York (1976).

Joseph A Gallian 2018, ‘A Dynamic Survey of Graph Labeling’, The Electronic Journal of Combinatorics.

Selestin Lina S, Asha S, ‘On Topological Cordial Graphs’, Journal of Science and Technology, 5(2020), 25-28.

"Selestin Lina S, Asha S, '" Topological cordial labeling of some graphs’, Malaya Journal of Matematik, Vol. 9, No. 1, 861-863.

S.Chandrakala, Fibonacci Prime Labeling of Udukkai and Octopus Graphs International Journal of Scientific Research and Reviews 2018, 7(2), 589-598.

Additional Files