𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The neighborhood inclusion structure of a graph

✍ Scribed by Frank Boesch; Charles Suffel; Ralph Tindell; Frank Harary

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
417 KB
Volume
17
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Neighborhood unions and the cycle cover
Neighborhood unions and the cycle cover number of a graph
✍ Guantao Chen; Ronald J. Gould; Michael S. Jacobson; Richard H. Schelp πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 413 KB

## Abstract For several years, the study of neighborhood unions of graphs has given rise to important structural consequences of graphs. In particular, neighborhood conditions that give rise to hamiltonian cycles have been considered in depth. In this paper we generalize these approaches to give a

The A4-structure of a graph
The A4-structure of a graph
✍ Michael D. Barrus; Douglas B. West πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 215 KB
Randić structure of a graph
Randić structure of a graph
✍ Juan Rada; Carlos UzcΓ‘tegui πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 198 KB

Let G be a collection of graphs with n vertices. We present a simple description of [G] = {H ∈ G: (H ) = (G)} where denotes the RandiΓƒ c index. We associate to G a Q-linear map : Q m β†’ Q k (for some integers k; m depending on G) such that the kernel of contains the necessary information to describe