Hamiltonicity, minimum degree and leaf number (Q1677599)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Hamiltonicity, minimum degree and leaf number |
scientific article; zbMATH DE number 6806134
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hamiltonicity, minimum degree and leaf number |
scientific article; zbMATH DE number 6806134 |
Statements
Hamiltonicity, minimum degree and leaf number (English)
0 references
10 November 2017
0 references
Let \(G\) be a graph. Then the leaf number of \(G\), denoted by \(L(G)\), is the maximum number of leaves in a spanning tree of \(G\). It is shown that if \(G\) is a connected graph with minimum degree \(\delta (G)\) such that \(\delta (G)\geq \frac{L(G)}{2}+1\) then \(G\) is Hamiltonian.
0 references
Hamiltonicity
0 references
traceability
0 references
minimum degree
0 references
leaf number
0 references
0.9596956372261048
0 references
0.8765118718147278
0 references
0.8742514252662659
0 references
0.845830500125885
0 references
0.8288983702659607
0 references
