On k-cordial Labeling of Some Graphs
Journal of Advances in Mathematics and Computer Science · pp. 1–7 · Published 8 Dec 2015
10.9734/BJMCS/2016/21768Abstract
In this paper we present k-cordiality of one point union of some path, cycle and star related graphs. We prove that bistar graph Bm,n is k-cordial for all k, restricted square graph B2n,n of Bistar is k-cordial for all k. We also prove that one point union of cycle C3 with star graph K1,n and one point union of path Pn with K1 are k-cordial for all k.
Cited by 7
R. Durgut, Hakan Kutucu, T. Turacı · RAIRO Oper. Res. · 2019
P. R. Hampiholi, Jotiba P. Kitturkar · 2016
Joseph A. Gallian · Electronic Journal of Combinatorics · 2009
Vecdi Aytaç, T. Turacı · Malaya Journal of Matematik · 2021
M. Modha · 2018
N. Rathod · 2017
M. Modha, K. Kanani · 2016
Related research
- The Universal Coefficient Theorem for Homology and Cohomology: An Enigma of Computations — shares topic coverage
- Cordial and Mean Labelings on Extended Duplicate Graph of Comb Graph — shares topic coverage
Article metrics
Real usage data collected on this platform.
0
Page views
0
PDF downloads
0
Outbound clicks
7
Citations
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
No views recorded yet.
Traffic sources
Referring site, by host.
No traffic recorded yet.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.