[BOOK][B] Inequalities for graph eigenvalues
Z Stanić - 2015 - books.google.com
Written for mathematicians working with the theory of graph spectra, this book explores more
than 400 inequalities for eigenvalues of the six matrices associated with finite simple graphs …
than 400 inequalities for eigenvalues of the six matrices associated with finite simple graphs …
[HTML][HTML] Graphs with least eigenvalue− 2: ten years on
D Cvetković, P Rowlinson, S Simić - Linear Algebra and its Applications, 2015 - Elsevier
Abstract The authors' monograph Spectral Generalizations of Line Graphs was published in
2004, following the successful use of star complements to complete the classification of …
2004, following the successful use of star complements to complete the classification of …
[HTML][HTML] Eigenvalue location in threshold graphs
Let G be a threshold graph of order n with adjacency matrix A. We present an O (n) algorithm
for constructing a diagonal matrix congruent to B x= A+ x I for any x. An application, using …
for constructing a diagonal matrix congruent to B x= A+ x I for any x. An application, using …
[HTML][HTML] No threshold graphs are cospectral
J Lazzarin, OF Márquez, FC Tura - Linear Algebra and its Applications, 2019 - Elsevier
A threshold graph G on n vertices is defined by binary sequence of length n. In this paper we
present an explicit formula for computing the characteristic polynomial of a threshold graph …
present an explicit formula for computing the characteristic polynomial of a threshold graph …
The Complete Classification of Graphs whose Second Largest Eigenvalue of the Eccentricity Matrix is Less Than 1
JF Wang, XY Lei, SC Li, Z Stanić - Acta Mathematica Sinica, English Series, 2024 - Springer
The eccentricity matrix of a graph is obtained from the distance matrix by kee** the entries
that are largest in their row or column, and replacing the remaining entries by zero. This …
that are largest in their row or column, and replacing the remaining entries by zero. This …
On the spectrum of threshold graphs
I Sciriha, S Farrugia - International Scholarly Research Notices, 2011 - Wiley Online Library
The antiregular connected graph on r vertices is defined as the connected graph whose
vertex degrees take the values of r− 1 distinct positive integers. We explore the spectrum of …
vertex degrees take the values of r− 1 distinct positive integers. We explore the spectrum of …
On graphs whose second largest eigenvalue is at most 1
M Liu, C Chen, Z Stanić - European Journal of Combinatorics, 2021 - Elsevier
On graphs whose second largest eigenvalue is at most 1 - ScienceDirect Skip to main
contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …
contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …
Characterization of outerplanar graphs whose second largest eigenvalue is at most 1
S Li, W Sun - Results in Mathematics, 2023 - Springer
Let λ 2 be the second largest eigenvalue of the adjacency matrix of a connected graph. In
2021, Liu, Chen and Stanić determined all the connected {K 1, 3, K 5-e}-free graphs whose …
2021, Liu, Chen and Stanić determined all the connected {K 1, 3, K 5-e}-free graphs whose …
Connected (K4− e)-free graphs whose second largest eigenvalue does not exceed 1
M Liu, C Chen, Z Stanić - European Journal of Combinatorics, 2024 - Elsevier
Connected graphs whose second largest eigenvalue λ 2 does not exceed 1 have been
investigated in the last four decades. Over the years only few particular classes with this …
investigated in the last four decades. Over the years only few particular classes with this …
On regular graphs and coronas whose second largest eigenvalue does not exceed 1
Z Stanić - Linear and Multilinear Algebra, 2010 - Taylor & Francis
Full article: On regular graphs and coronas whose second largest eigenvalue does not exceed
1 Skip to Main Content Taylor and Francis Online homepage Taylor and Francis Online …
1 Skip to Main Content Taylor and Francis Online homepage Taylor and Francis Online …