New results on odd harmonious labeling of graphs
Künye
Jeyanthi, P. & Philo, S. (2022). New results on odd harmonious labeling of graphs. TWMS Journal Of Applied And Engineering Mathematics, 12(4), 1301-1310.Özet
Let G = (V, E) be a graph with p vertices and q edges. A graph G is said to be odd harmonious if there exists an injection f : V (G) ? {0, 1, 2, · · · , 2q ? 1}such that the induced function f* : E(G) ? {1, 3, · · · , 2q ? 1} defined by f* (uv) = f(u) + f(v) is a bijection. If f(V (G)) = {0, 1, 2, · · · , q} then f is called strongly odd harmonious labeling and the graph is called strongly odd harmonious graph. In this paper we prove that Spl(Cbn) and Spl(B(m)(n)), slanting ladder SLn, mGn, H-super subdivision of path Pn and cycle Cn, n ? 0(mod 4) admit odd harmonious labeling. In addition we observe that all strongly odd harmonious graphs admit mean labeling, odd mean labeling, odd sequential labeling and all odd sequential graphs are odd harmonious and all odd harmonious graphs are even sequential harmonious.
Cilt
12Sayı
4Bağlantı
http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/4941http://jaem.isikun.edu.tr/web/index.php/archive/117-vol12no4/913
Koleksiyonlar
Aşağıdaki lisans dosyası bu öğe ile ilişkilidir:
İlgili Öğeler
Başlık, yazar, küratör ve konuya göre gösterilen ilgili öğeler.
-
Even vertex odd mean labeling of transformed trees
Jeyanthi, Pon; Ramya, D.; Selvi, M. (Işık University Press, 2020)Let G = (V;E) be a graph with p vertices and q edges. A graph G is said have an even vertex odd mean labeling if there exists a function f: V (G) →{0; 2; 4;:::; 2q} satisfying f is 1-1 and the induced map f*: E(G) → {1; ... -
Highly total prime labeling for some duplicate graph
Kavitha, Panneer Selvam (Işık University Press, 2022)Let G = (V, E) be a graph with p vertices and q edges. A bijection f : V ?E ? {1, 2, · · · , p+q} is said to be a highly total prime labeling if (i) for each edge e = uv, the labels assigned to u and v are relatively prime ... -
Prime and co-prime edge anti-magic vertex labeling of families of unicyclic graphs in sensor network
Chitra, Ganesan; Anand, M. Clement Joe; Ittanagi, Basavaraj M.; Ranjitha, B.; Cangül, İsmail Naci (Işık University Press, 2025-01)A finite simple undirected graph containing p vertices and q edges is called as prime anti-magic if it has an injection from the vertex set of integers {1, 2, . . . , p} satisfying that for each edge uv, the labels given ...