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

Connected graphs containing a given connected graph as a unique greatest common subgraph

โœ Scribed by Gary Chartrand; Mark Johnson; Ortrud R. Oellermann

Publisher
Springer
Year
1986
Tongue
English
Weight
609 KB
Volume
31
Category
Article
ISSN
0001-9054

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

On graphs containing a given graph as ce
On graphs containing a given graph as center
โœ Fred Buckley; Zevi Miller; Peter J. Slater ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 367 KB ๐Ÿ‘ 1 views

## Abstract We examine the problem of embedding a graph __H__ as the center of a supergraph __G__, and we consider what properties one can restrict __G__ to have. Letting __A(H)__ denote the smallest difference โˆฃ__V(G)__โˆฃ โ€ โˆฃ__V(H)__โˆฃ over graphs __G__ having center isomorphic to __H__ it is demons