Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/9300
Full metadata record
DC FieldValueLanguage
dc.rights.licenseBY-NC-ND-
dc.contributor.authorRamane H.-
dc.contributor.authorGutman, Ivan-
dc.contributor.authorGundloor M.-
dc.date.accessioned2020-09-19T17:57:52Z-
dc.date.available2020-09-19T17:57:52Z-
dc.date.issued2015-
dc.identifier.issn1450-9628-
dc.identifier.urihttps://scidar.kg.ac.rs/handle/123456789/9300-
dc.description.abstractThe 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.-
dc.rightsopenAccess-
dc.rights.urihttps://creativecommons.org/licenses/by-nc-nd/4.0/-
dc.sourceKragujevac Journal of Mathematics-
dc.titleSeidel energy of iterated line graphs of regular graphs-
dc.typearticle-
dc.identifier.doi10.5937/KgJMath1501007R-
dc.identifier.scopus2-s2.0-84933044224-
Appears in Collections:Faculty of Science, Kragujevac

Page views(s)

64

Downloads(s)

4

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


This item is licensed under a Creative Commons License Creative Commons