Some new aspects of main eigenvalues of graphs

DOI10.1007/S40314-019-0987-1MaRDI QIDQ2301013zbMATH OpenOpenAlexWikidataFDO

Authors Yanyan Li

Publication date 28 February 2020

Published in Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1605.03533, http://hdl.handle.net/10773/29486

zbMATH Keywords

conedouble starharmonic graphmain eigenvaluepath

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Association schemes, strongly regular graphs (05E30)

Abstract: An eigenvalue of the adjacency matrix of a graph is said to be emph{main} if the all-1 vector is not orthogonal to the associated eigenspace. In this work, we approach the main eigenvalues of some graphs. The graphs with exactly two main eigenvalues are considered and a relation between those main eigenvalues is presented. The particular case of harmonic graphs is analyzed and they are characterized in terms of their main eigenvalues without any restriction on its combinatorial structure. We give a necessary and sufficient condition for a graph $G$ to have $-1-lambd{a}_{min}$ as an eigenvalue of its complement, where $lambd{a}_{min}$ denotes the least eigenvalue of $G$. Also, we prove that among connected bipartite graphs, $K_{r,r}$ is the unique graph for which the index of the complement is equal to $-1-lambd{a}_{min}$. Finally, we characterize all paths and all double stars (trees with diameter three) for which the smallest eigenvalue is non-main. Main eigenvalues of paths and double stars are identified.

Review text

An eigenvalue of the adjacency matrix of a graph is said to be main if the all-1 vector is non-orthogonal to the associated eigenspace. This paper explores some new aspects of the study of main eigenvalues of graphs, investigating specifically cones over strongly regular graphs for which the least eigenvalue is non-main. In particular, the authors characterized paths and trees of diameter three with non-main least eigenvalue. It is noted that the importance of least eigenvalues of graphs for the equilibria of social and economic networks has been recently uncovered in literature.

Recommendations

• The main eigenvalues of a graph: a survey
• On graphs with given main eigenvalues
• scientific article; zbMATH DE number 1823892
• Some results on graphs with exactly two main eigenvalues
• scientific article; zbMATH DE number 2116377
• scientific article; zbMATH DE number 2010090
• Graphs with \(n - 1\) main eigenvalues
• A note on graphs with exactly two main eigenvalues
• Main eigenvalues of a graph
• On main eigenvalues of chain graphs

Cites work

• A note on graphs with exactly two main eigenvalues
• A table of connected graphs on six vertices
• An introduction to the theory of graph spectra
• Bicyclic graphs with exactly two main eigenvalues
• Biregular graphs with three eigenvalues
• Construction of graphs with exactly \(k\) main eigenvalues
• Eigenspaces of graphs
• Graphs with three distinct eigenvalues and largest eigenvalue less than 8
• Graphs with three eigenvalues and second largest eigenvalue at most 1
• Graphs with two main and two plain eigenvalues
• Harmonic trees
• scientific article; zbMATH DE number 5079740 (Why is no real title available?)
• scientific article; zbMATH DE number 3657843 (Why is no real title available?)
• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• scientific article; zbMATH DE number 2116377 (Why is no real title available?)
• scientific article; zbMATH DE number 3324507 (Why is no real title available?)
• scientific article; zbMATH DE number 3377258 (Why is no real title available?)
• Main eigenvalues and \((\kappa ,\tau )\)-regular sets
• Main eigenvalues of a graph
• More on graphs with just three distinct eigenvalues
• Multiplicative cones - a family of three eigenvalue graphs
• Multiplicative designs II. Uniform normal and related structures
• Nonregular graphs with three eigenvalues
• On graphs with given main eigenvalues
• On graphs with just three distinct eigenvalues
• On graphs with three eigenvalues
• Some results on graph spectra
• Spectra of graphs
• Spectral upper bounds for the order of a \(k\)-regular induced subgraph
• Spectral upper bounds on the size of k-regular induced subgraphs
• The cost of segregation in (social) networks
• The main eigenvalues of a graph: a survey
• The number of walks in a graph
• The walk partition and colorations of a graph
• Unicyclic graphs with exactly two main eigenvalues
• Walks and the spectral radius of graphs

Cited in

(15)

• On the main spectrum of generalized Bethe trees
• Graphs with few distinct eigenvalues and extremal energy
• Graphs with \(n - 1\) main eigenvalues
• On main eigenvalues of chain graphs
• Signed complete graphs with maximum index
• Main eigenvalues of a graph
• scientific article; zbMATH DE number 5947262 (Why is no real title available?)
• Main eigenvalues and automorphisms of a graph
• scientific article; zbMATH DE number 2010090 (Why is no real title available?)
• Construction of graphs with exactly \(k\) main eigenvalues
• On irregularity indices and main eigenvalues of graphs and their applicability
• A note on (local) energy of a graph
• Graphs with exactly three main eigenvalues
• Main eigenvalues for normal matrices and mixed graphs
• Eigenvalues of neutral networks: interpolating between hypercubes

This page was built for publication: Some new aspects of main eigenvalues of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2301013)