𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On minimum degree in Hamiltonian path graphs

✍ Scribed by George R. T. Hendry

Publisher
John Wiley and Sons
Year
1988
Tongue
English
Weight
294 KB
Volume
12
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the hamiltonian path graph of a graph
On the hamiltonian path graph of a graph
✍ George R. T. Hendry 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 491 KB 👁 1 views

The hamiltonian path graph H(F) of a graph F is that graph having the same vertex set as F and in which two vertices u and u are adjacent if and only if F contains a hamiltonian u -u path. First, in response to a conjecture of Chartrand, Kapoor and Nordhaus, a characterization of nonhamiltonian grap

On k-domination and minimum degree in gr
On k-domination and minimum degree in graphs
✍ Odile Favaron; Adriana Hansberg; Lutz Volkmann 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB 👁 1 views

## Abstract A subset __S__ of vertices of a graph __G__ is __k__‐dominating if every vertex not in __S__ has at least __k__ neighbors in __S__. The __k__‐domination number $\gamma\_k(G)$ is the minimum cardinality of a __k__‐dominating set of __G__. Different upper bounds on $\gamma\_{k}(G)$ are kn

Powers of Hamiltonian paths in interval
Powers of Hamiltonian paths in interval graphs
✍ Isaak, Garth 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 232 KB 👁 3 views

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 wi

Metamaterial inclusions based on grid-gr
Metamaterial inclusions based on grid-graph Hamiltonian paths
✍ Vincenzo Pierro; John McVay; Vincenzo Galdi; Ahmad Hoorfar; Nader Engheta; Innoc 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 287 KB

## Abstract This article deals with a study of novel classes of metamaterial inclusions based on space‐filling curves. The graph–theoretic Hamiltonian‐path (HP) concept is exploited to construct a fairly broad class of space‐filling curve geometries that include as special cases the well‐known Hilb

On the minimum degree of minimal Ramsey
On the minimum degree of minimal Ramsey graphs
✍ Tibor Szabó; Philipp Zumstein; Stefanie Zürcher 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB 👁 1 views

## Abstract We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by Burr et al. We determine the corresponding graph parameter for numerous bipartite graphs, including bi‐regular bipartite graphs and forests. We also make initial progress for graphs of l