On edge product cordial graphs

• Autorzy: Ivanco Jaroslav

Identyfikatory

DOI

10.7494/OpMath.2019.39.5.691

• Języki publikacji: EN

Abstrakty

EN

An edge product cordial labeling is a variant of the well-known cordial labeling. In this paper we characterize graphs admitting an edge product cordial labeling. Using this characterization we investigate the edge product cordiality of broad classes of graphs, namely, dense graphs, dense bipartite graphs, connected regular graphs, unions of some graphs, direct products of some bipartite graphs, joins of some graphs, maximal k-degenerate and related graphs, product cordial graphs.

Słowa kluczowe

EN

edge product cordial labelings; dense graphs; regular graphs

• Wydawca: AGH University of Science and Technology Press
• Czasopismo: Opuscula Mathematica
• Rocznik: 2019
• Tom: Vol. 39, no. 5
• Strony: 691--703
• Opis fizyczny: Bibliogr. 17 poz.

Twórcy

autor

Ivanco Jaroslav

• P.J. Safarik University Institute of Mathematics Jesenna 5, 041 54 Kosice, Slovakia

Bibliografia

• [1] M. Borowiecki, I. Broere, M. Frick, P. Mihók, G. Semanišin, A survey of hereditary properties of graphs, Discuss. Math. Graph Theory 17 (1997), 5–50.
• [2] I. Cahit, Cordial graphs: A weaker version of graceful and harmonious graphs, Ars Combin. 23 (1987), 201–207.
• [3] T. Gallai, Über extreme Punkt- und Kantenmengen, Ann. Univ. Sci. Budapest, Eötvös Sect. Math. 2 (1959), 133–138.
• [4] J.A. Gallian, A dynamic survey of graph labeling, Electron. J. Combin. (2016), #DS6
• [5] J. Ivanco, On k-total edge product cordial graphs, Australas. J. Combin. 67 (2017), 476-485.
• [6] D.R. Lick, A.R. White, k-degenerate graphs, Can. J. Math. 22 (1970), 1082-1096.
• [7] J. Mitchem, Maximal k-degenerate graphs, Util. Math. 11 (1977), 101-106.
• [8] U.M. Prajapati, N.B. Patel, Edge product cordial labeling of some cycle related graphs, Open J. Discrete Math. 6 (2016), 268-278.
• [9] U.M. Prajapati, P.D. Shah, Some edge product cordial graphs in the context of duplication of some graphs elements, Open J. Discrete Math. 6 (2016), 248-258.
• [10] M. Sundaran, R. Ponraj, S. Somasundaram, Product cordial labeling of graphs, Bull. Pure and Appl. Sci., Sect. E, Math. Stat. 23 (2004), 155-163.
• [11] S.K. Vaidya, CM. Barasara, Edge product cordial labeling of graphs, J. Math. Comput. Sci. 2 (2012), 1436-1450.
• [12] S.K. Vaidya, CM. Barasara, Some edge product cordial graphs, Inter. J. Math. Soft Comput. 3 (2013), 49-53.
• [13] S.K. Vaidya, CM. Barasara, Some new families of edge product cordial graphs, Adv. Model. Optim. 15 (2013), 103-111.
• [14] S.K. Vaidya, CM. Barasara, Edge product cordial labeling in the context of some graph operations, Internat. J. Math. Scientific Comput. 3 (2013), 4-7.
• [15] S.K. Vaidya, CM. Barasara, Total edge product cordial labeling of graphs, Malaya J. Mathematik 3 (2013) 2, 55-63.
• [16] S.K. Vaidya, CM. Barasara, On edge product cordial labeling of some product related graphs, Internat. J. Math. Appl. 2 (2014), 15-22.
• [17] S.K. Vaidya, CM. Barasara, Product and edge product cordial labeling of degree splitting graph of some graphs, Adv. Appl. Discrete Math. 15 (2015), 61-74.