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

A simpler counterexample to the Reconstruction Conjecture for denumerable graphs

โœ Scribed by J Fisher; R.L Graham; F Harary

Book ID
107883989
Publisher
Elsevier Science
Year
1972
Tongue
English
Weight
88 KB
Volume
12
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A counterexample to a conjecture on the
A counterexample to a conjecture on the bondage number of a graph
โœ Ulrich Teschner ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 113 KB

The bondage number h(G) of a nonempty graph G was first introduced by Fink, Jacobson, Kinch and Roberts in [3]. They generalized a former approach to domination-critical graphs, In their publication they conjectured that b(G)<d(G)+ 1 for any nonempty graph G.