AbstractThe spread of a graph is defined to be the difference between the greatest eigenvalue and the least eigenvalue of the adjacency matrix of the graph. In this paper we determine the unique graph with minimum least eigenvalue among all connected bicyclic graphs of order n. Also, we determine the unique graph with maximum spread in this class for each n⩾28
AbstractLet U(n,k) be the set of unicyclic graphs with n vertices and k pendant vertices. In this pa...
A signed graph is a pair (G,sigma), where G is a graph and sigma is the sign function on the edges o...
Abstract In this paper, we determine the unique graph whose least signless Laplacian eigenvalue atta...
AbstractThe spread of a graph is defined to be the difference between the greatest eigenvalue and th...
AbstractThe spread of a graph is defined to be the difference between the largest eigenvalue and the...
AbstractThe spread of a graph is defined to be the difference between the largest eigenvalue and the...
AbstractThe Laplacian spread of a graph is defined to be the difference between the largest eigenval...
AbstractLet G be a simple connected graph with n vertices and n edges which we call a unicyclic grap...
AbstractThe problem of identifying those simple, undirected graphs with n vertices and k edges that ...
AbstractIn this paper, we identify within connected graphs of order n and size n+k (with 0⩽k⩽4 and n...
Let G be a simple connected graph with n vertices and n edges which we call an unicyclic graph. In t...
In a certain class of graphs, a graph is called minimizing if the least eigenvalue of its adjacency ...
In a certain class of graphs, a graph is called minimizing if the least eigenvalue of its adjacency ...
AbstractLet G be a simple graph and A(G) be the adjacency matrix of G. The eigenvalues of G are thos...
A signed graph is a pair (G,sigma), where G is a graph and sigma is the sign function on the edges o...
AbstractLet U(n,k) be the set of unicyclic graphs with n vertices and k pendant vertices. In this pa...
A signed graph is a pair (G,sigma), where G is a graph and sigma is the sign function on the edges o...
Abstract In this paper, we determine the unique graph whose least signless Laplacian eigenvalue atta...
AbstractThe spread of a graph is defined to be the difference between the greatest eigenvalue and th...
AbstractThe spread of a graph is defined to be the difference between the largest eigenvalue and the...
AbstractThe spread of a graph is defined to be the difference between the largest eigenvalue and the...
AbstractThe Laplacian spread of a graph is defined to be the difference between the largest eigenval...
AbstractLet G be a simple connected graph with n vertices and n edges which we call a unicyclic grap...
AbstractThe problem of identifying those simple, undirected graphs with n vertices and k edges that ...
AbstractIn this paper, we identify within connected graphs of order n and size n+k (with 0⩽k⩽4 and n...
Let G be a simple connected graph with n vertices and n edges which we call an unicyclic graph. In t...
In a certain class of graphs, a graph is called minimizing if the least eigenvalue of its adjacency ...
In a certain class of graphs, a graph is called minimizing if the least eigenvalue of its adjacency ...
AbstractLet G be a simple graph and A(G) be the adjacency matrix of G. The eigenvalues of G are thos...
A signed graph is a pair (G,sigma), where G is a graph and sigma is the sign function on the edges o...
AbstractLet U(n,k) be the set of unicyclic graphs with n vertices and k pendant vertices. In this pa...
A signed graph is a pair (G,sigma), where G is a graph and sigma is the sign function on the edges o...
Abstract In this paper, we determine the unique graph whose least signless Laplacian eigenvalue atta...
DOI
Add to ORKG