AbstractLet G be a graph with n vertices and ρ be the spectral radius of its adjacency matrix. Recently, Nikiforov showed that if G has no 4-cycle, then ρ2-ρ-(n-1)⩽0, with equality if and only if G is the friendship graph. However, this bound is not attainable when n is even. He conjectured that if G is a C4-free graph with even number of vertices, then ρ3-ρ2-(n-1)ρ+1⩽0, with equality if and only if G is a star of order n with n/2-1 disjoint additional edges. We prove the conjecture in this paper
We prove a number of relations between the number of cliques of a graph G and the largest eigenvalue...
AbstractLet G be a graph with n vertices and μ(G) be the largest eigenvalue of the adjacency matrix ...
We prove three results about the spectral radius μ(G) of a graph G:(a)Let Tr (n) be the r-partite Tu...
Suppose that G is a graph with n vertices and m edges, and let μ be the spectral radius of its adjac...
AbstractSuppose that G is a graph with n vertices and m edges, and let μ be the spectral radius of i...
AbstractLet G be a simple connected graph with n vertices and m edges. Let A be the adjacency matrix...
AbstractLet G be a simple connected graph with n vertices and m edges. Let δ(G)=δ be the minimum deg...
Let μ(G) denote the spectral radius of a graph G. We partly confirm a conjecture due to Nikiforov, w...
AbstractLet G be a simple graph with n vertices and let Gc be its complement. Let ρ(G) be the spectr...
AbstractIn this paper we determine the graphs which have the minimal spectral radius (i.e., the larg...
Let G be a graph with n vertices and μ (G) be the largest eigenvalue of the adjacency matrix of G. W...
AbstractThe spectral radius ϱ(A) of the adjacency matrix A of a graph G with e edges satisfies ϱ(A)⩽...
Let $G$ be a graph of size $m$ and $\rho(G)$ be the spectral radius of its adjacency matrix. A graph...
Let A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. For any ...
AbstractWe prove three results about the spectral radius μ(G) of a graph G:(a)Let Tr(n) be the r-par...
We prove a number of relations between the number of cliques of a graph G and the largest eigenvalue...
AbstractLet G be a graph with n vertices and μ(G) be the largest eigenvalue of the adjacency matrix ...
We prove three results about the spectral radius μ(G) of a graph G:(a)Let Tr (n) be the r-partite Tu...
Suppose that G is a graph with n vertices and m edges, and let μ be the spectral radius of its adjac...
AbstractSuppose that G is a graph with n vertices and m edges, and let μ be the spectral radius of i...
AbstractLet G be a simple connected graph with n vertices and m edges. Let A be the adjacency matrix...
AbstractLet G be a simple connected graph with n vertices and m edges. Let δ(G)=δ be the minimum deg...
Let μ(G) denote the spectral radius of a graph G. We partly confirm a conjecture due to Nikiforov, w...
AbstractLet G be a simple graph with n vertices and let Gc be its complement. Let ρ(G) be the spectr...
AbstractIn this paper we determine the graphs which have the minimal spectral radius (i.e., the larg...
Let G be a graph with n vertices and μ (G) be the largest eigenvalue of the adjacency matrix of G. W...
AbstractThe spectral radius ϱ(A) of the adjacency matrix A of a graph G with e edges satisfies ϱ(A)⩽...
Let $G$ be a graph of size $m$ and $\rho(G)$ be the spectral radius of its adjacency matrix. A graph...
Let A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. For any ...
AbstractWe prove three results about the spectral radius μ(G) of a graph G:(a)Let Tr(n) be the r-par...
We prove a number of relations between the number of cliques of a graph G and the largest eigenvalue...
AbstractLet G be a graph with n vertices and μ(G) be the largest eigenvalue of the adjacency matrix ...
We prove three results about the spectral radius μ(G) of a graph G:(a)Let Tr (n) be the r-partite Tu...