Cordial Labeling in Context of Barycentric Subdivision of Special Graphs
@inproceedings{Ghodasara2013CordialLI, title={Cordial Labeling in Context of Barycentric Subdivision of Special Graphs}, author={G. V. Ghodasara and A. 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.
References
SHOWING 1-10 OF 11 REFERENCES
The cordiality of the path-union of n copies of a graph
- Mathematics, Computer Science
- Discret. Math.
- 1996
- 43
- PDF
Rokad, “Cordial labeling of Kn,n related graphs
- International Journal of Science & Research, Volume 2 Issue
- 2013
A dynemic survey of graph labeling
- The Electronics Journal of Combinatorics, 19
- 2012
Some new cordial graphs
- Internat. J. Scientific Computing, 2
- 2008
A note on cordial labeling of mutiple shells
- Trends Math.,
- 2002
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