๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The minimum size of graphs hamiltonian-connected from a vertex

โœ Scribed by C.J. Knickerbocker; Patti Frazer Lock; Michael Sheard

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
136 KB
Volume
76
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ 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

Graphs uniquely hamiltonian-connected fr
Graphs uniquely hamiltonian-connected from a vertex
โœ G.R.T Hendry ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 558 KB

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 hamilto

Hamiltonian properties of the cube of a
Hamiltonian properties of the cube of a 2-edge connected graph
โœ M. Paoli ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 514 KB

Let G be a 2-edge connected graph with a t least 5 vertices. For any given vertices a, b, c, and din G with a # b, there exists in G3 a hamiltonian path with endpoints a and b avoiding the edge cd, and there exists in G3 U {cd} a hamiltonian path with endpoints a and b and containing the edge cd. Al