AbstractWe identify in some classes of unicyclic graphs (of fixed order and girth) those graphs whose index, i.e. the largest eigenvalue, is maximal. Besides, some (lower and upper) bounds on the indices of the graphs being considered are provided
AbstractWe improve some recent results on graph eigenvalues. In particular, we prove that if G is a ...
AbstractConnected graphs in which the number of edges equals the number of vertices are called unicy...
Let G = (V;E) be a simple, undirected graph with maximum and minimum degree ∆ and respectively, and ...
The largest eigenvalue, or index, of simple graphs is extensively studied in literature. Usually, th...
Signed graphs are graphs whose edges get signs ±1 and, as for unsigned graphs, they can be studied b...
AbstractThe index of a graph is the largest eigenvalue of its adjacency matrix. Among the trees with...
AbstractBy the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G...
AbstractThe Estrada index of a graph G is defined as EE(G)=∑i=1neλi, where λ1,λ2,…,λn are the eigenv...
AbstractLet G be a simple graph. Let λ1(G) and μ1(G) denote the largest eigenvalue of the adjacency ...
AbstractThe index of a simple graph is the largest eigenvalue of its adjacency matrix. It is well-kn...
AbstractIn the paper, we identify graphs with the maximal signless Laplacian spectral radius among a...
The index of a signed graph is the largest eigenvalue of its adjacency matrix. We establish the firs...
AbstractWe consider two classes of graphs: (i) trees of order n and diameter d=n−3 and (ii) unicycli...
AbstractThe index of a graph is the largest eigenvalue (or spectral radius) of its adjacency matrix....
AbstractWe consider the set of unicyclic graphs with prescribed degree sequence. In this set we dete...
AbstractWe improve some recent results on graph eigenvalues. In particular, we prove that if G is a ...
AbstractConnected graphs in which the number of edges equals the number of vertices are called unicy...
Let G = (V;E) be a simple, undirected graph with maximum and minimum degree ∆ and respectively, and ...
The largest eigenvalue, or index, of simple graphs is extensively studied in literature. Usually, th...
Signed graphs are graphs whose edges get signs ±1 and, as for unsigned graphs, they can be studied b...
AbstractThe index of a graph is the largest eigenvalue of its adjacency matrix. Among the trees with...
AbstractBy the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G...
AbstractThe Estrada index of a graph G is defined as EE(G)=∑i=1neλi, where λ1,λ2,…,λn are the eigenv...
AbstractLet G be a simple graph. Let λ1(G) and μ1(G) denote the largest eigenvalue of the adjacency ...
AbstractThe index of a simple graph is the largest eigenvalue of its adjacency matrix. It is well-kn...
AbstractIn the paper, we identify graphs with the maximal signless Laplacian spectral radius among a...
The index of a signed graph is the largest eigenvalue of its adjacency matrix. We establish the firs...
AbstractWe consider two classes of graphs: (i) trees of order n and diameter d=n−3 and (ii) unicycli...
AbstractThe index of a graph is the largest eigenvalue (or spectral radius) of its adjacency matrix....
AbstractWe consider the set of unicyclic graphs with prescribed degree sequence. In this set we dete...
AbstractWe improve some recent results on graph eigenvalues. In particular, we prove that if G is a ...
AbstractConnected graphs in which the number of edges equals the number of vertices are called unicy...
Let G = (V;E) be a simple, undirected graph with maximum and minimum degree ∆ and respectively, and ...
DOI
Add to ORKG