AbstractLet H(n, e) denote the set of all connected graphs having n vertices and e edges. The graphs in H(n, n + k) with maximal index are determined for k of form (r2)−1 and n arbitrary
The Merrifield-Simmons index of a graph G is defined as the total number of its independent sets. A ...
AbstractBy Vizing's theorem, the chromatic index χ′(G) of a simple graph G satisfies Δ(G) ≤ χ′(G) ≤ ...
AbstractLet B+(2k) be the set of all bicyclic graphs on 2k(k⩾2) vertices with perfect matchings. In ...
The largest eigenvalue, or index, of simple graphs is extensively studied in literature. Usually, th...
AbstractBy the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G...
Among the Hamiltonian graphs with a prescribed number of edges, the unique graph with maximal index ...
AbstractWe identify in some classes of unicyclic graphs (of fixed order and girth) those graphs whos...
AbstractAmong the graphs with a prescribed number of edges, those with maximal index are determined....
[[abstract]]By the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where...
AbstractA maximal graph is a connected graph with degree sequence not majorized by the degree sequen...
AbstractThe index of a graph is the largest eigenvalue of its adjacency matrix. Among the trees with...
AbstractIn this work we show that among all n-vertex graphs with edge or vertex connectivity k, the ...
Ahlswede R, Katona GOH. Graphs with maximal number of adjacent pairs of edges. Acta mathematica Acad...
The Szeged index is a new topological index based on distances between the vertices of a graph. The ...
AbstractIn this paper, we give sufficient conditions for simple graphs to be class 1. These conditio...
The Merrifield-Simmons index of a graph G is defined as the total number of its independent sets. A ...
AbstractBy Vizing's theorem, the chromatic index χ′(G) of a simple graph G satisfies Δ(G) ≤ χ′(G) ≤ ...
AbstractLet B+(2k) be the set of all bicyclic graphs on 2k(k⩾2) vertices with perfect matchings. In ...
The largest eigenvalue, or index, of simple graphs is extensively studied in literature. Usually, th...
AbstractBy the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G...
Among the Hamiltonian graphs with a prescribed number of edges, the unique graph with maximal index ...
AbstractWe identify in some classes of unicyclic graphs (of fixed order and girth) those graphs whos...
AbstractAmong the graphs with a prescribed number of edges, those with maximal index are determined....
[[abstract]]By the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where...
AbstractA maximal graph is a connected graph with degree sequence not majorized by the degree sequen...
AbstractThe index of a graph is the largest eigenvalue of its adjacency matrix. Among the trees with...
AbstractIn this work we show that among all n-vertex graphs with edge or vertex connectivity k, the ...
Ahlswede R, Katona GOH. Graphs with maximal number of adjacent pairs of edges. Acta mathematica Acad...
The Szeged index is a new topological index based on distances between the vertices of a graph. The ...
AbstractIn this paper, we give sufficient conditions for simple graphs to be class 1. These conditio...
The Merrifield-Simmons index of a graph G is defined as the total number of its independent sets. A ...
AbstractBy Vizing's theorem, the chromatic index χ′(G) of a simple graph G satisfies Δ(G) ≤ χ′(G) ≤ ...
AbstractLet B+(2k) be the set of all bicyclic graphs on 2k(k⩾2) vertices with perfect matchings. In ...
DOI
Add to ORKG