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

Maximum graphs with a unique k-factor

โœ Scribed by G.R.T Hendry


Book ID
107884203
Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
563 KB
Volume
37
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A census of maximum uniquely hamiltonian
โœ 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.

Graphs with unique minimum edge dominati
โœ Jerzy Topp ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 816 KB

Topp, J., Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices, Discrete Mathematics 12 1 (1993) 199-210. A set I of vertices of a graph G is an independent set if no two vertices of I are adjacent. A set M of edges of G is an edge dominating s