𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The partial complement of graphs

✍ Scribed by G. Chartrand; S. F. Kapoor; D. R. Lick; S. Schuster

Book ID
105329301
Publisher
Springer Netherlands
Year
1985
Tongue
English
Weight
813 KB
Volume
16
Category
Article
ISSN
0031-5303

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Partial Complement of a Graph
Partial Complement of a Graph
✍ H.B. Walikar πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 172 KB
Hyperbolicity and complement of graphs
Hyperbolicity and complement of graphs
✍ Sergio Bermudo; JosΓ© M. RodrΓ­guez; JosΓ© M. Sigarreta; Eva TourΓ­s πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 280 KB

If X is a geodesic metric space and x 1 , x 2 , x 3 ∈ X , a geodesic triangle T = {x 1 , x 2 , x 3 } is the union of the three geodesics [x 1 x 2 ], [x 2 x 3 ] and [x 3 x 1 ] in X . The space X is δ-hyperbolic (in the Gromov sense) if any side of T is contained in a δ-neighborhood of the union of th

On the honesty of graph complements
On the honesty of graph complements
✍ K.S. Bagga; L.W. Beineke; M.J. Lipman; R.E. Pippert πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 342 KB

A graph is called honest if its edge-integrity equals its order. It is shown in this paper that except for the path of length 3, every graph that is not honest has an honest complemenk. This result is extended to complements of products and applied to the Nordhaus-Gaddum theory for edgeintegrity.

Disconnected Complements of Steinhaus gr
Disconnected Complements of Steinhaus graphs
✍ Wayne M. Dymàček; Matthew Koerlin; Jean-Guy Speton; Tom Whaley; Jennifer Yanulav πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 548 KB