Publication date
September 1989
DOI Publisher
Academic Press Limited. Published by Elsevier Ltd. ISSN
0195-6698Abstract
Among the Hamiltonian graphs with a prescribed number of edges, the unique graph with maximal index is determined
Among the Hamiltonian graphs with a prescribed number of edges, the unique graph with maximal index is determined
AbstractBy the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G...
AbstractFor suitable integers p and k, let f(p, k) denote the maximum number of edges in a graph of ...
In this paper we prove that if G is a (k + 2)-connected graph on n > 3 vertices satisfying P(n + ...
Among the Hamiltonian graphs with a prescribed number of edges, the unique graph with maximal index ...
AbstractLet G be a connected graph other than a path and ham (G),Δ (G) be its hamiltonian index and ...
AbstractLet G be a graph of order n and α the independence number of G. We show that if G is a 2- co...
AbstractA graph G is called uniquely hamiltonian-connected from a vertex ν of G if G contains exactl...
AbstractLet G be a graph of order n and μ(G) be the largest eigenvalue of its adjacency matrix. Let ...
AbstractLet H(n, e) denote the set of all connected graphs having n vertices and e edges. The graphs...
AbstractLet G be a graph. Then the hamiltonian index h(G) of G is the smallest number of iterations ...
summary:Let $G$ be a connected simple graph on $n$ vertices. The Laplacian index of $G$, namely, ...
AbstractA graph G is called uniquely Hamiltonian-connected from a vertex v if, for every vertex u ≠ ...
AbstractA set S of edge-disjoint hamilton cycles in a graph T is said to be maximal if the hamilton ...
AbstractAn extension of a theorem of Chartrand and Wall is obtained and, with it, a bound on the ham...
For a set of graphs F, let H(n; F) denote the class of non-bipartite Hamiltonian graphs on n vertice...
AbstractBy the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G...
AbstractFor suitable integers p and k, let f(p, k) denote the maximum number of edges in a graph of ...
In this paper we prove that if G is a (k + 2)-connected graph on n > 3 vertices satisfying P(n + ...
Among the Hamiltonian graphs with a prescribed number of edges, the unique graph with maximal index ...
AbstractLet G be a connected graph other than a path and ham (G),Δ (G) be its hamiltonian index and ...
AbstractLet G be a graph of order n and α the independence number of G. We show that if G is a 2- co...
AbstractA graph G is called uniquely hamiltonian-connected from a vertex ν of G if G contains exactl...
AbstractLet G be a graph of order n and μ(G) be the largest eigenvalue of its adjacency matrix. Let ...
AbstractLet H(n, e) denote the set of all connected graphs having n vertices and e edges. The graphs...
AbstractLet G be a graph. Then the hamiltonian index h(G) of G is the smallest number of iterations ...
summary:Let $G$ be a connected simple graph on $n$ vertices. The Laplacian index of $G$, namely, ...
AbstractA graph G is called uniquely Hamiltonian-connected from a vertex v if, for every vertex u ≠ ...
AbstractA set S of edge-disjoint hamilton cycles in a graph T is said to be maximal if the hamilton ...
AbstractAn extension of a theorem of Chartrand and Wall is obtained and, with it, a bound on the ham...
For a set of graphs F, let H(n; F) denote the class of non-bipartite Hamiltonian graphs on n vertice...
AbstractBy the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G...
AbstractFor suitable integers p and k, let f(p, k) denote the maximum number of edges in a graph of ...
In this paper we prove that if G is a (k + 2)-connected graph on n > 3 vertices satisfying P(n + ...
Add to ORKG