• Corpus ID: 9294986

Cordial Labeling in Context of Barycentric Subdivision of Special Graphs

@inproceedings{Ghodasara2013CordialLI,
  title={Cordial Labeling in Context of Barycentric Subdivision of Special Graphs},
  author={Gaurang V. Ghodasara and A. H. Rokad},
  year={2013}
}
In this paper we discuss cordial labeling in context of barycentric subdivision of shell graph, complete bipartite graph Kn,n and wheel graph. AMS subject classification: 05C78. 

Figures and Tables from this paper

References

SHOWING 1-10 OF 12 REFERENCES

Cordial Labeling of K n , n related graphs

It is proved by cahit that Km,n is cordial for all m and n. In this paper cordial labeling for three graphs related to complete bipartite graph Kn,n is discussed. We prove that (1) star of Kn,n, (2)

A Dynamic Survey of Graph Labeling

TLDR
In this survey I have collected everything I could find on graph labelings techniques that have appeared in journals that are not widely available.

Prime cordial labeling of some wheel related graphs

A prime cordial labeling of a graph G with the vertex set V (G) is a bijection f : V (G) → {1, 2, 3, . . . , |V (G)|} such that each edge uv is assigned the label 1 if gcd(f(u), f(v)) = 1 and 0 if

Graph theory

Some new cordial graphs

  • Internat. J. Scientific Computing, 2
  • 2008

Rokad, “Cordial labeling of Kn,n related graphs

  • International Journal of Science & Research, Volume 2 Issue
  • 2013

Cordial labeling of grid related graphs

  • International Journal of Combinatorial Graph Theory and Applications, 6
  • 2013

New classes of graphs with α−valuation

  • harmonious and cordial labelings”, Ph.D.Thesis, Anna University, 2001. Madurai Kamraj University
  • 2002

On cordial and 3-equitable labellings of graphs

  • Util. Math., 37
  • 1990