{Cn, C4}-Decomposition of the line graph of the complete graph
Künye
Arthi, K., Sankari, C. & Sangeetha, R. (2022). {Cn, C4}-Decomposition of the line graph of the complete graph. TWMS Journal Of Applied And Engineering Mathematics, 12(4), 1441-1447.Özet
For given positive integer n ≥ 4, let Cn, Kn and L(Kn) respectively denote a cycle with n edges, a complete graph on n vertices and the line graph of the complete graph Kn. For a given graph G, if H1, H2, ..., Hl are the edge disjoint subgraphs such that E(G) = E(H1) ∪ E(H2) ∪ ... ∪ E(Hl), then we say that H1, H2, ..., Hl decompose G. If G has a decomposition into copies of H1 and H2 using atleast one of each, then we say that G has a {H1, H2}-decomposition (or) G is {H1, H2}-decomposable. In this paper, it is proved that L(Kn) is {Cn, C4}-decomposable.
Kaynak
TWMS Journal Of Applied And Engineering MathematicsCilt
12Sayı
4Bağlantı
https://hdl.handle.net/11729/4954http://jaem.isikun.edu.tr/web/index.php/archive/117-vol12no4/926
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.
-
Balanced rank distribution labeling of ladder graphs, complete graphs and complete bipartite graphs
Hemalatha, Palanisamy; Gokilamani, S. (Işık University Press, 2021)A balanced rank distribution labeling of a graph G of order n is a new kind of vertex labeling from {1, 2, 3, ..., k}(n <= k is an element of Z(+)) which leads to a balanced edge labeling of G called edge ranks. In this ... -
Hub-integrity of splitting graph and duplication of graph elements
Mahde, Sultan Senan; Mathad, Veena (Işık University Press, 2016-01-08)The hub-integrity of a graph G = (V (G), E(G)) is denoted as HI(G) and defined by HI(G) = min{|S| + m(G − S), S is a hub set of G}, where m(G − S) is the order of a maximum component of G − S. In this paper, we discuss ... -
On certain topological indices of the derived graphs of subdivision graphs
Hosamani, Sunilkumar M.; Lokesha, Veerebradiah; Cangül, İsmail Naci; Devendraiah, K. M. (Işık University Press, 2016-03-11)The derived graph [G]† of a graph G is the graph having the same vertex set as G, with two vertices of [G]† being adjacent if and only if their distance in G is two. Topological indices are valuable in the study of QSAR/QSPR. ...