The Least Eigenvalue of the Complement of the Square Power Graph of G (original) (raw)
Related papers
On main eigenvalues of certain graphs
2016
An eigenvalue of the adjacency matrix of a graph is said to be 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 − λ min as an eigenvalue of its complement, where λ 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 − λ 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.
On normalized Laplacian eigenvalues of power graphs associated to finite cyclic groups
2021
For a simple connected graphG of order n, the normalized Laplacian is a square matrix of order n, defined as L(G) = D(G)− 1 2L(G)D(G)− 1 2 , where D(G)− 1 2 is the diagonal matrix whose i-th diagonal entry is 1 √ di . In this article, we find the normalized Laplacian eigenvalues of the joined union of regular graphs in terms of the adjacency eigenvalues and the eigenvalues of quotient matrix associated with graph G. For a finite group G, the power graph P(G) of a group G is defined as the simple graph in which two distinct vertices are joined by an edge if and only if one is the power of other. As a consequence of the joined union of graphs, we investigate the normalized Laplacian eigenvalues of power graphs of finite cyclic group Zn.
Recent progress on graphs with fixed smallest eigenvalue
arXiv: Combinatorics, 2020
We give a survey on graphs with fixed smallest eigenvalue, especially on graphs with large minimal valency and also on graphs with good structures. Our survey mainly consists of the following two parts: (i) Hoffman graphs, the basic theory related to Hoffman graphs and the applications of Hoffman graphs to graphs with fixed smallest eigenvalue and large minimal valency; (ii) recent results on distance-regular graphs and co-edge regular graphs with fixed smallest eigenvalue and the characterizations of certain families of distance-regular graphs. At the end of the survey, we also discuss signed graphs with fixed smallest eigenvalue and present some new findings.
On the multiplicity of the eigenvalues of a graph
Acta Mathematica Hungarica, 2007
Given a graph G with characteristic polynomial ϕ(t), we consider the ML-decomposition ϕ(t) = q1(t)q2(t) 2 . . . qm(t) m , where each qi(t) is an integral polynomial and the roots of ϕ(t) with multiplicity j are exactly the roots of qj(t). We give an algorithm to construct the polynomials qi(t) and describe some relations of their coefficients with other combinatorial invariants of G. In particular, we get new bounds for the energy E(G) = n i=1 |λ i | of G, where λ 1 , λ 2 , . . . , λ n are the eigenvalues of G (with multiplicity). Most of the results are proved for the more general situation of a Hermitian matrix whose characteristic polynomial has integral coefficients. * This work was done during a visit of the second named author to UNAM.
Least eigenvalue of the connected graphs whose complements are cacti
Open Mathematics
Suppose that Γ is a graph of order n and A(Γ) = [ai,j] is its adjacency matrix such that ai,j is equal to 1 if vi is adjacent to vj and ai,j is zero otherwise, where 1 ≤ i, j ≤ n. In a family of graphs, a graph is called minimizing if the least eigenvalue of its adjacency matrix is minimum in the set of the least eigenvalues of all the graphs. Petrović et al. [On the least eigenvalue of cacti, Linear Algebra Appl., 2011, 435, 2357-2364] characterized a minimizing graph in the family of all cacti such that the complement of this minimizing graph is disconnected. In this paper, we characterize the minimizing graphs G ∈ beginarrayitOmegacnendarray\begin{array}{} {\it\Omega}^c_n \end{array}beginarrayitOmegacnendarray, i.e. \begin{array}{} \displaystyle \lambda_{min}(G)\leq\lambda_{min}(C^c) \end{array}$$ for each Cc ∈ beginarrayitOmegacnendarray\begin{array}{} {\it\Omega}^c_n \end{array}beginarrayitOmegacnendarray, where beginarrayitOmegacnendarray\begin{array}{} {\it\Omega}^c_n \end{array}beginarrayitOmegacnendarray is a collection of connected graphs such that the complement of each graph of order n is a cactus with the condition that ...
Minimum Rank of Graphs Powers Family
Open Journal of Discrete Mathematics, 2012
In this paper we study the relationship between minimum rank of graph G and the minimum rank of graph j G for some families of special graph G, where j G is the jth power of graph G.
On the characteristic polynomial of power graphs
Filomat
The power graph P(G) of finite group G is a graph whose vertex set is G and two distinct vertices are adjacent if one is a power of the other. In this paper, we determine the characteristic polynomial of the power graphs of groups of order a product of three primes.
Electronic Journal of Linear Algebra, 2015
Given a simple graph G, let A(G) be its adjacency matrix. A principal submatrix of A(G) of order one less than the order of G is the adjacency matrix of its vertex deleted subgraph. It is well-known that the multiplicity of any eigenvalue of A(G) and such a principal submatrix can differ by at most one. Therefore, a vertex v of G is a downer vertex (neutral vertex, or Parter vertex) with respect to a fixed eigenvalue μ if the multiplicity of μ in A(G)âv goes down by one (resp., remains the same, or goes up by one). In this paper, we consider the problems of characterizing these three types of vertices under various constraints imposed on graphs being considered, on vertices being chosen and on eigenvalues being observed. By assigning weights to edges of graphs, we generalizeour results to weighted graphs, or equivalently to symmetric matrices.
A note on graphs with exactly two main eigenvalues
Linear Algebra and its Applications
In this note, we consider connected graphs with exactly two main eigenvalues. We will give several constructions for them, and as a consequence we show a family of those graphs with an unbounded number of distinct valencies. 2010 Mathematics Subject Classification. 05C50.