Abstract
Given a bijection \(f:V(G) \rightarrow \{1,2,\cdots ,|V(G)|\}\), we associate two integers \(S=f(u)+f(v)\) and \(D=|f(u)-f(v)|\) with every edge uv in E(G). The labeling f induces an edge labeling \(f':E(G) \rightarrow \{0,1\}\) such that for any edge uv in E(G), \(f'(uv)=1\) if \(gcd(S,D)=1\), and \(f'(uv)=0\) otherwise. Let \(e_{f'}(i)\) be the number of edges labeled with \(i \in \{0,1\}\). We say f is SD-prime cordial labeling if \(|e_{f'}(0)-e_{f'}(1)| \le 1\). Moreover G is SD-prime cordial if it admits SD-prime cordial labeling. In this paper, we investigate some new construction of SD-prime cordial graph.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Baskar Babujee, J., Babitha, S.: New constructions of edge bimagic graphs from magic graphs. Appl. Mathe. 2, 1393–1396 (2011)
Gallian, J.A.: A dynamic survey of graph labeling. Electronic J. Combin. 18, #DS6 (2015)
Harary, F.: Graph Theory. Addison-wesley, Reading (1972)
Lau, G.C., Chu, H.H., Suhadak, N., Foo, F.Y., Ng, H.K.: On SD-prime cordial graphs. Int. J. Pure Appl. Mathe. 106(4), 1017–1028 (2016)
Lau, G.C., Shiu, W.C.: On SD-prime labeling of graphs. Utilitas Math. (2014, accepted)
Lau, G.C., Shiu, W.C., Ng, H.K., Ng, C.D., Jeyanthi, P.: Further results on SD-prime labeling. J. Combin. Math. Combin. Comput. 98, 151–170 (2016)
Lourdusamy, A., Patrick, F.: Some results on SD-prime labeling of graphs. Proyecciones. 36(3) (2017)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Lourdusamy, A., Patrick, F. (2017). New Construction on SD-Prime Cordial Labeling. In: Arumugam, S., Bagga, J., Beineke, L., Panda, B. (eds) Theoretical Computer Science and Discrete Mathematics. ICTCSDM 2016. Lecture Notes in Computer Science(), vol 10398. Springer, Cham. https://doi.org/10.1007/978-3-319-64419-6_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-64419-6_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-64418-9
Online ISBN: 978-3-319-64419-6
eBook Packages: Computer ScienceComputer Science (R0)