AbstractIn this paper we consider the trees with fixed order n and diameter d≤4. Among these trees we identify those trees whose index is minimal
In this article, we investigate several issues related to the use of the index S(G), known as the Z...
AbstractThe spectral radius of a graph (i.e., the largest eigenvalue of its corresponding adjacency ...
AbstractThe index of a graph is the largest eigenvalue (or spectral radius) of its adjacency matrix....
AbstractIn this paper we consider the trees with fixed order n and diameter d≤4. Among these trees w...
AbstractIn this paper we determine the graphs which have the minimal spectral radius (i.e., the larg...
AbstractFor a graph G, its Laplacian matrix is the difference of the diagonal matrix of its vertex d...
Studying graphs by means of the largest eigenvalue of the adjacency matrix (the index) has been a pr...
AbstractThe index of a graph is the largest eigenvalue of its adjacency matrix. Among the trees with...
AbstractIn this paper, we identify within connected graphs of order n and size n+k (with 0⩽k⩽4 and n...
The largest eigenvalue, or index, of simple graphs is extensively studied in literature. Usually, th...
AbstractThe spectral radius ρ(G) of a graph G is the largest eigenvalue of its adjacency matrix A(G)...
AbstractWe identify in some classes of unicyclic graphs (of fixed order and girth) those graphs whos...
AbstractA semiregular tree is a tree where all non-pendant vertices have the same degree. Among all ...
AbstractWe consider two classes of graphs: (i) trees of order n and diameter d=n−3 and (ii) unicycli...
The spectral radius of a graph is the largest eigenvalue of the adjacency matrix of the graph. Let $...
In this article, we investigate several issues related to the use of the index S(G), known as the Z...
AbstractThe spectral radius of a graph (i.e., the largest eigenvalue of its corresponding adjacency ...
AbstractThe index of a graph is the largest eigenvalue (or spectral radius) of its adjacency matrix....
AbstractIn this paper we consider the trees with fixed order n and diameter d≤4. Among these trees w...
AbstractIn this paper we determine the graphs which have the minimal spectral radius (i.e., the larg...
AbstractFor a graph G, its Laplacian matrix is the difference of the diagonal matrix of its vertex d...
Studying graphs by means of the largest eigenvalue of the adjacency matrix (the index) has been a pr...
AbstractThe index of a graph is the largest eigenvalue of its adjacency matrix. Among the trees with...
AbstractIn this paper, we identify within connected graphs of order n and size n+k (with 0⩽k⩽4 and n...
The largest eigenvalue, or index, of simple graphs is extensively studied in literature. Usually, th...
AbstractThe spectral radius ρ(G) of a graph G is the largest eigenvalue of its adjacency matrix A(G)...
AbstractWe identify in some classes of unicyclic graphs (of fixed order and girth) those graphs whos...
AbstractA semiregular tree is a tree where all non-pendant vertices have the same degree. Among all ...
AbstractWe consider two classes of graphs: (i) trees of order n and diameter d=n−3 and (ii) unicycli...
The spectral radius of a graph is the largest eigenvalue of the adjacency matrix of the graph. Let $...
In this article, we investigate several issues related to the use of the index S(G), known as the Z...
AbstractThe spectral radius of a graph (i.e., the largest eigenvalue of its corresponding adjacency ...
AbstractThe index of a graph is the largest eigenvalue (or spectral radius) of its adjacency matrix....
DOI
Add to ORKG