✦ LIBER ✦

Graphs uniquely hamiltonian-connected from a vertex

✍ Scribed by G.R.T Hendry

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 558 KB
Volume: 49
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(84)90151-1

No coin nor oath required. For personal study only.

✦ Synopsis

A graph G is called uniquely hamiitonian-connected from a vertex v if, for every vertex u ¢: v, there is exactly one v-u hamiltonian path in G. The main results are that if [ V(G)[ = n 3, then (1) deg(v) is even (2) n is odd, and ( ) IE(G)[<~(3n-3)I2. Several constructions of graphs uniquely hamiltonian-connected from a vertex are given.

📜 SIMILAR VOLUMES

The size of graphs uniquely hamiltonian-

The size of graphs uniquely hamiltonian-connected from a vertex

✍ G.R.T Hendry 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 220 KB

A graph G is called uniquely hamiltonian-connected from a vertex v of G if G contains exactly one v-u hamiltonian path for each vertex u, u ~ v. It is shown that if G is uniquely hamiltonian-connected from a vertex v and G has order n/> 5, then G has exactly ½(3n-3) edges, G -v has exactly one hamil

The minimum size of graphs hamiltonian-c

The minimum size of graphs hamiltonian-connected from a vertex

✍ C.J. Knickerbocker; Patti Frazer Lock; Michael Sheard 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 136 KB

Extremal maximal uniquely hamiltonian gr

Extremal maximal uniquely hamiltonian graphs

✍ Curtiss A. Barefoot; R. C. Entringer 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 352 KB

## Abstract Let __G__ be a graph of order __n__ with exactly one Hamiltonian cycle and suppose that __G__ is maximal with respect to this property. We determine the minimum number of edges __G__ can have.

A census of maximum uniquely hamiltonian

A census of maximum uniquely hamiltonian graphs

✍ Curtiss A. Barefoot; R. C. Entringer 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 261 KB 👁 1 views

## Abstract We show that there are 2^[n/2]‐4^ largest graphs of order __n__ ≥ 7 having exactly one hamiltonian cycle. a recursive procedure for constructing these graphs is described.

Finding all the hamiltonian paths of a g

Finding all the hamiltonian paths of a graph and investigation of hamiltonian-connected graphs

✍ V.P. Kozyrev 📂 Article 📅 1976 🏛 Elsevier Science ⚖ 700 KB

Vertex-transitive graphs that remain con

Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors

✍ Y. O. Hamidoune; A. Lladó; S. C. López 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 148 KB

A d-regular graph is said to be superconnected if any disconnecting subset with cardinality at most d is formed by the neighbors of some vertex. A superconnected graph that remains connected after the failure of a vertex and its neighbors will be called vosperian. Let be a vertex-transitive graph of