DOIAbstract
AbstractSuppose that G is a connected graph of order n and girth g<n. Let k be the multiplicity of an eigenvalue μ of G. Sharp upper bounds for k are n-g+2 when μ∈{-1,0}, and n-g otherwise. The graphs attaining these bounds are described
AbstractSuppose that G is a connected graph of order n and girth g<n. Let k be the multiplicity of an eigenvalue μ of G. Sharp upper bounds for k are n-g+2 when μ∈{-1,0}, and n-g otherwise. The graphs attaining these bounds are described
AbstractWe consider the general problem of determining the maximum possible multiplicity of an eigen...
AbstractWe prove three results about the spectral radius μ(G) of a graph G:(a)Let Tr(n) be the r-par...
For a simple, undirected graph G(n), let lambda(i)(G(n)) be the ith largest eigenvalue of G(n). This...
Suppose that G is a connected graph of order n and girth g<n. Let k be the multiplicity of an eig...
AbstractSuppose that G is a connected graph of order n and girth g<n. Let k be the multiplicity of a...
We improve some recent results on graph eigenvalues. In particular, we prove that if G is a graph of...
AbstractWe improve some recent results on graph eigenvalues. In particular, we prove that if G is a ...
We improve some recent results on graph eigenvalues. In particular, we prove that if G is a graph of...
AbstractLet λ2 be the second largest eigenvalue of a graph. Powers (1988) [4] gave some upper bounds...
summary:Let $G$ be a connected graph of order $n$ and $U$ a unicyclic graph with the same order. We ...
AbstractLet λ1(G)⩾⋯⩾λn(G) be the eigenvalues of a graph G. We explore the distribution of eigenvalue...
Let G be a simple and undirected graph. The eigenvalues of the adjacency matrix of G are called the ...
AbstractWe compute the eigenvalues of the complete multipartite graph and present some applications ...
AbstractUpper and lower estimates are found for the maximum of the kth eigenvalue of a graph as a fu...
AbstractLet G be a simple graph of order n with t triangle(s). Also let λ1(G),λ2(G),…,λn(G) be the e...
AbstractWe consider the general problem of determining the maximum possible multiplicity of an eigen...
AbstractWe prove three results about the spectral radius μ(G) of a graph G:(a)Let Tr(n) be the r-par...
For a simple, undirected graph G(n), let lambda(i)(G(n)) be the ith largest eigenvalue of G(n). This...
Suppose that G is a connected graph of order n and girth g<n. Let k be the multiplicity of an eig...
AbstractSuppose that G is a connected graph of order n and girth g<n. Let k be the multiplicity of a...
We improve some recent results on graph eigenvalues. In particular, we prove that if G is a graph of...
AbstractWe improve some recent results on graph eigenvalues. In particular, we prove that if G is a ...
We improve some recent results on graph eigenvalues. In particular, we prove that if G is a graph of...
AbstractLet λ2 be the second largest eigenvalue of a graph. Powers (1988) [4] gave some upper bounds...
summary:Let $G$ be a connected graph of order $n$ and $U$ a unicyclic graph with the same order. We ...
AbstractLet λ1(G)⩾⋯⩾λn(G) be the eigenvalues of a graph G. We explore the distribution of eigenvalue...
Let G be a simple and undirected graph. The eigenvalues of the adjacency matrix of G are called the ...
AbstractWe compute the eigenvalues of the complete multipartite graph and present some applications ...
AbstractUpper and lower estimates are found for the maximum of the kth eigenvalue of a graph as a fu...
AbstractLet G be a simple graph of order n with t triangle(s). Also let λ1(G),λ2(G),…,λn(G) be the e...
AbstractWe consider the general problem of determining the maximum possible multiplicity of an eigen...
AbstractWe prove three results about the spectral radius μ(G) of a graph G:(a)Let Tr(n) be the r-par...
For a simple, undirected graph G(n), let lambda(i)(G(n)) be the ith largest eigenvalue of G(n). This...
Add to ORKG