Product cordial labeling of hypercube related graphs
Downloads
DOI:
https://doi.org/10.26637/MJM0804/0112Abstract
In this paper we investigate the product cordial labeling of hypercube graph, path union of the hypercube graphs, S(t,Pn),Ptn(tn,Qk) and graph obtained by joining two copies of hypercube by arbitrary length of path.
Keywords:
Product cordial graphs, Hypercube graph, Path union of graphs, Open star of graphs, One point union of path graphs.Mathematics Subject Classification:
Mathematics- Pages: 1991-1994
- Date Published: 01-10-2020
- Vol. 8 No. 04 (2020): Malaya Journal of Matematik (MJM)
Graph Theory, Springer, 2012.
J. A. Gallian, A dynamic survey of graph labeling, Electronic Journal of Combinatorics 1 Dynamic Surveys, 2018.
K. Kanani and G. Ghodasara, Some New Product Cordial Graphs, International Conference on Image Information Processing (ICIIP 2011), IEEE Catalogue number: CFP1169N-ART ISBN: 978-1-61284-861-7. 10.1109/ICIIP.2011.6108917.
M. Meghpara, Graceful Labeling for One Point Union for Path of Graphs, International Journal of Mathematics And its Applications, 3(1)(2015), 49-54.
M. Sundaram, Ponraj and R. Somsundaram, Product cordial labeling of graphs, Bull. Pure and Applied Sciences (Mathematics and Statistics), 23E(2004), 155-163.
S. K. Vaidya, C. M.Barasara, Product Cordial Labeling for some New Graphs, Journal of mathematics Research, $3(2)(2011), 206-211$.
- NA
Metrics
Published
How to Cite
Issue
Section
License
Copyright (c) 2020 MJM

This work is licensed under a Creative Commons Attribution 4.0 International License.