IJPAM: Volume 114, No. 3 (2017)

Title

ON VERTEX PRODUCT CORDIAL LABELING

Authors

Neelam Kumari$^1$, Seema Mehra$^2$
$^{1,2}$Department of Mathematics
M.D. University
Rohtak, 124001, Haryana, INDIA

Abstract

In this paper, we define the vertex product cordial labeling for some path related graphs like $P_n^2$, path union of $k$ copies of $P_n^2$ graph and $P_n \odot K_1$. We also discuss vertex product cordial labeling of helm graph and some graphs related to gear graph. In the present paper, we also show that the graph obtained from cycle $C_n$ after switching of a vertex admits vertex product cordial labeling. Moreover we show that corona product $C_n \odot K_1$, ladder graph $P_n \times P_2$ with one edge path to one vertex, $C_n \odot \bar{K}_m$ and the banana tree $BT(n_1,n_2,n_3)$ also admits vertex product cordial labeling with certain conditions.

History

Received: December 30, 2016
Revised: April 8, 2017
Published: May 23, 2017

AMS Classification, Key Words

AMS Subject Classification: 05C78
Key Words and Phrases: vertex product cordial graph, gear graphs, Banana tree, Ladder graph, corona product

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
I. Cahit, Cordial graphs: A weaker version of graceful and harmonious graphs, Ars Combinatoria, 23 (1987), 201-207.

2
S. M. Lee and A. Liu, A construction of $k$-graceful graphs from complete bipartite graphs, SEA BULL Math., 12 (1988), 23-30.

3
J. A. Gallian, A dynamic survey of graph labeling, The Electronics Journal of Combinatorics, 19 (2012), 1-260.

4
F. Harary, Graph Theory, Addision-Wesley, Reading, MA (1969).

5
A. Rosa, On certain valuations of the vertices of a graph, Theory of graphs, International Symposium, Rome (1966), Gordon and Breach, New York and Dunod Paris, 1967, 349-355.

6
Y. S. Ho, S. M. Lee and S.C. Shee, Cordial labeling of unicyclic graphs and generalized Petersen graphs, Congr. Numer., 68 (1989), 109-122.

7
M. A. Seoud and A.E.I. Abdel Maqsoud, On cordial and belanced labeling of graphs, J. Egyptian math. Soc., 7 (1999), 127-135.

8
M. A. Seoud, A.T. Diab and E.A. Elsahawi, On stronglyharmonious, relatively prime, odd graceful and cordial graph, Proc. Math. Phys. Soc. Egypt, 73 (1998), 33-55.

9
M. A. Seoud and A.E.I. Abdel Maqsoud, On 3-equitable and magic labeling, preprint.

10
M. Sundaram, R. Ponraj and S. Somasundaram, Product cordial labeling of graphs, Bull. Pure and Applied Science (Mathematics and Statistics), 23 (2004), 155-163.

11
M. Sundaram, R. Ponraj and S. Somasundaram, Prime cordial labeling of graphs, Journal of the Indian Academy of Mathematics, 27 (2) (2005), 373-390.

12
S. K. Vaidya and N. A. Dani, Some new product cordial graphs, Journal of App. Comp. Sci. Math., 8 (4) (2010), 62-65.

13
S. K. Vaidya and C. M. Barasara, Product cordial labeling for some new graphs, Journal of Mathematics Research, 3 (2) (2011), 206-211.

14
S. K. Vaidya and C. M. Barasara, Some product cordial graphs, Elixir Discrete Mathematics, 41 (2011), 5948-5952.

15
S. K. Vaidya and K. K. Kanani, Some cycle related product cordial graphs, Int. J. of Algorsithms, Comp. and Math., 3 (1) (2010), 109-116.

How to Cite?

DOI: 10.12732/ijpam.v114i3.11 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: 114
Issue: 3
Pages: 553 - 570


Google Scholar; DOI (International DOI Foundation); WorldCAT.

CC BY This work is licensed under the Creative Commons Attribution International License (CC BY).