A note on line graphs
Künye
Satyanarayana, B., Srinivasulu, D. & Syam Prasad, K. (2017). A note on line graphs. TWMS Journal Of Applied And Engineering Mathematics, 7(1), 173-179.Özet
The line graph and 1-quasitotal graph are well-known concepts in graph theory. In Satyanarayana, Srinivasulu, and Syam Prasad [13], it is proved that if a graph G consists of exactly m connected components Gi (1 ? i ? m) then L(G) = L(G1) = L(G2) ? ... ? L(Gm) where L(G) denotes the line graph of G, and ? denotes the ring sum operation on graphs. In [13], the authors also introduced the concept 1- quasitotal graph and obtained that Q1(G) = G?L(G) where Q1(G) denotes 1-quasitotal graph of a given graph G. In this note, we consider zero divisor graph of a finite associate ring R and we will prove that the line graph of Kn?1 contains the complete graph on n vertices where n is the number of elements in the ring R.
Cilt
7Sayı
1Bağlantı
http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/2621http://jaem.isikun.edu.tr/web/index.php/archive/93-vol7no1/290
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 ... -
On the injective chromatic number of splitting graph and shadow graph of certain regular and biregular graphs
C. K., Bhanupriya; M. S., Sunitha (Işık University Press, 2025-01)The injective chromatic number of a graph G, denoted by χi(G) is the minimum number of colors needed to color the vertices of G such that two vertices with a common neighbor are assigned distinct colors. The splitting graph ... -
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 ...