Please use this identifier to cite or link to this item:
Title: Seidel energy of iterated line graphs of regular graphs
Authors: Ramane H.
Gutman, Ivan
Gundloor M.
Issue Date: 2015
Abstract: The Seidel matrix S(G) of a graph G is the square matrix whose (i, j)-entry is equal to -1 or 1 if the i-th and j-th vertices of G are adjacent or non-adjacent, respectively, and is zero if i = j. The Seidel energy of G is the sum of the absolute values of the eigenvalues of S(G). We show that if G is regular of order n and of degree r ≥ 3, then for each k ≥ 2, the Seidel energy of the k-th iterated line graph of G depends solely on n and r. This result enables the construction of pairs of non-cospectral, Seidel equienergetic graphs of the same order.
Type: article
DOI: 10.5937/KgJMath1501007R
ISSN: 1450-9628
SCOPUS: 2-s2.0-84933044224
Appears in Collections:Faculty of Science, Kragujevac

Page views(s)




Files in This Item:
File Description SizeFormat 
10.5937-KgJMath1501007R.pdf126.18 kBAdobe PDFThumbnail

This item is licensed under a Creative Commons License Creative Commons