A note on line graphs
Citation
Satyanarayana, B., Srinivasulu, D. & Syam Prasad, K. (2017). A note on line graphs. TWMS Journal Of Applied And Engineering Mathematics, 7(1), 173179.Abstract
The line graph and 1quasitotal graph are wellknown 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 1quasitotal 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.
Source
TWMS Journal Of Applied And Engineering MathematicsVolume
7Issue
1URI
https://hdl.handle.net/11729/2621http://jaem.isikun.edu.tr/web/index.php/archive/93vol7no1/290
Collections
The following license files are associated with this item:
Related items
Showing items related by title, author, creator and subject.

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 ... 
Hubintegrity of splitting graph and duplication of graph elements
Mahde, Sultan Senan; Mathad, Veena (Işık University Press, 20160108)The hubintegrity 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, 20160311)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. ...