AbstractThe index of a graph is the largest eigenvalue of its adjacency matrix. Among the trees with a fixed order and diameter, a graph with the maximal index is a caterpillar. In the set of caterpillars with a fixed order and diameter, or with a fixed degree sequence, we identify those whose index is maximal
AbstractWe identify in some classes of unicyclic graphs (of fixed order and girth) those graphs whos...
AbstractThe Wiener index of a graph is the sum of the distances between all pairs of vertices, it ha...
Abstract. Let G be a simple connected graph on n vertices and λ1, λ2,..., λn be the eigenvalues of t...
AbstractThe index of a graph is the largest eigenvalue of its adjacency matrix. Among the trees with...
A segment of a tree is a path whose ends are branching vertices (vertices of degree greater than 2) ...
The extremal questions of maximizing or minimizing various distance-based graph invariants among tre...
AbstractThe index of a simple graph is the largest eigenvalue of its adjacency matrix. It is well-kn...
AbstractThe Estrada index of a graph G is defined as EE(G)=∑i=1neλi, where λ1,λ2,…,λn are the eigenv...
Among all connected cactuses with n vertices we find a unique graph whose largest eigenvalue (index,...
AbstractThe index of a graph is the largest eigenvalue (or spectral radius) of its adjacency matrix....
In this article, we investigate several issues related to the use of the index S(G), known as the Z...
AbstractLet G be a graph on n vertices, and let λ1,λ2,…,λn be its eigenvalues. The Estrada index is ...
AbstractA caterpillar graph is a tree in which the removal of all pendant vertices results in a chor...
AbstractThe Wiener index of a graph is the sum of all pairwise distances of vertices of the graph. I...
AbstractAmong the graphs with a prescribed number of edges, those with maximal index are determined....
AbstractWe identify in some classes of unicyclic graphs (of fixed order and girth) those graphs whos...
AbstractThe Wiener index of a graph is the sum of the distances between all pairs of vertices, it ha...
Abstract. Let G be a simple connected graph on n vertices and λ1, λ2,..., λn be the eigenvalues of t...
AbstractThe index of a graph is the largest eigenvalue of its adjacency matrix. Among the trees with...
A segment of a tree is a path whose ends are branching vertices (vertices of degree greater than 2) ...
The extremal questions of maximizing or minimizing various distance-based graph invariants among tre...
AbstractThe index of a simple graph is the largest eigenvalue of its adjacency matrix. It is well-kn...
AbstractThe Estrada index of a graph G is defined as EE(G)=∑i=1neλi, where λ1,λ2,…,λn are the eigenv...
Among all connected cactuses with n vertices we find a unique graph whose largest eigenvalue (index,...
AbstractThe index of a graph is the largest eigenvalue (or spectral radius) of its adjacency matrix....
In this article, we investigate several issues related to the use of the index S(G), known as the Z...
AbstractLet G be a graph on n vertices, and let λ1,λ2,…,λn be its eigenvalues. The Estrada index is ...
AbstractA caterpillar graph is a tree in which the removal of all pendant vertices results in a chor...
AbstractThe Wiener index of a graph is the sum of all pairwise distances of vertices of the graph. I...
AbstractAmong the graphs with a prescribed number of edges, those with maximal index are determined....
AbstractWe identify in some classes of unicyclic graphs (of fixed order and girth) those graphs whos...
AbstractThe Wiener index of a graph is the sum of the distances between all pairs of vertices, it ha...
Abstract. Let G be a simple connected graph on n vertices and λ1, λ2,..., λn be the eigenvalues of t...
DOI
Add to ORKG