IJPAM: Volume 112, No. 5 (2017)
Title
GEOMETRIC MEAN CORDIAL LABELING OFSUBDIVISION OF STANDARD GRAPHS
Authors
K. Chitra LakshmiVirudhunagar, 626 001, Tamil Nadu, INDIA
Sri S.R.N.M. College
Sattur, 626 203, Tamil Nadu, INDIA
Abstract
LetIn this paper, the geometric mean cordiality of subdivision of path, cycle, star and complete bipartite graphs are discussed.
History
Received: December 31, 2016
Revised: January 30, 2017
Published: March 30, 2017
AMS Classification, Key Words
AMS Subject Classification: 05C78
Key Words and Phrases: cordial labeling, cordial graphs, geometric mean cordial labeling, geometric mean cordial graphs, subdivision
Download Section
Download paper from here.You will need Adobe Acrobat reader. For more information and free download of the reader, see the Adobe Acrobat website.
Bibliography
- 1
- J. A. Bondy and U. S. R. Murthy, Graph Theory with Applications, Newyork, North Holland 1976.
- 2
- I. Cahit, Cordial Graphs: A weaker version of graceful and harmonious graphs, Ars. Combinatoria, vol. 23, No 3, 1987, pp, 201 - 207.
- 3
- J. A. Gallian, A Dynamic Survey of Graph Labeling, vol 18, 2011, pp, 1-219.
- 4
- F. Harary, Graph Theory, Addison Wesley, New Delhi 1969.
- 5
- R. Ponraj, M. Sivakumar, Mean Cordial Labeling of Graphs, Open Journal of Discrete Mathematics, vol 2, No 4, 2012, pp 145.
- 6
- K. Nagarajan, K. Chitra Lakshmi, Geometric Mean Cordial
Labeling,
International Journal of Mathematics and Soft Computing, January 2017, accepted. - 7
- Grimaldi, P. Ralph, Discrete and Combinatorial Mathematics. Don Mills: Addison - Wesley, 1994.
How to Cite?
DOI: 10.12732/ijpam.v112i5.12 How to cite this paper?Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Year: 2017
Volume: 112
Issue: 5
Pages: 103 -
Google Scholar; DOI (International DOI Foundation); WorldCAT.
This work is licensed under the Creative Commons Attribution International License (CC BY).

