Aug 15, 2021 · We generalize several classic theorems on hamiltonicity of graphs which due to Vergnas, Erdős, Chvátal and Erdős to spanning -connectedness.
In the paper, we first generalize a classic theorem of Vergnas on hamiltonian graphs to spanning k-connectedness. Furthermore, we determine extremal number of ...
In the paper, we first generalize a classic theorem of Vergnas on hamiltonian graphs to spanning k-connectedness. Furthermore, we determine extremal number of ...
Generalizations of the classics to spanning connectedness · Eminjan Sabir, J. Meng · Published in Applied Mathematics and… 2021 · Mathematics.
Some classic results about Hamiltonicity of graphs are generalized to spanning connectedness. • Extremal number of edges, which can guarantee that a graph ...
Generalizations of the classics to spanning connectedness. · connected components · artificial intelligence · machine learning · evolutionary algorithm · prior ...
The concept of cuts are generalized to tackle with this type of problems. The classical edge and vertex connectivity parameters are generalized. Also a ...
The concept of cuts are generalized to tackle with weighted graph problems, the classical edge and vertex connectivity parameters are generalized and a ...
Missing: connectedness. | Show results with:connectedness.
If (G − X0)(e1,e2) is collapsible, then (G − X0)(e1,e2) has a spanning connected subgraph L with O(L) = O(X0). This indicates that L ∪ X0 is a spanning eulerian.
The generalized k -connectivity κ k ( G ) of a graph G , introduced by Hager in 1985, is a natural generalization of the classical connectivity.