Results regarding the pebbling number of various graphs are presented. We say a graph is of Class 0 if its pebbling number equals the number of its vertices. For diameter d we conjecture that every graph of sufficient connectivity is of Class 0. We verify the conjecture for d = 2 by characterizing t
Powers of Hamiltonian paths in interval graphs
β Scribed by Isaak, Garth
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 232 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
β¦ Synopsis
We give a simple proof that the obvious necessary conditions for a graph to contain the k th power of a Hamiltonian path are sufficient for the class of interval graphs. The proof is based on showing that a greedy algorithm tests for the existence of Hamiltonian path powers in interval graphs. We will also discuss covers by powers of paths and analogues of the Hamiltonian completion number.
π SIMILAR VOLUMES
The role of the sympathetic limb of the autonomic nervous system (ANS) in the mediation of oscillations in consecutive beat-to-beat RR interval (RRI) and systolic blood pressure (SBP) values of lizards, Gallotia galloti, was investigated using spectral analysis and measuring effects of autonomic blo