𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Intriguing Sets of Vertices of Regular Graphs

✍ Scribed by Bart De Bruyn; Hiroshi Suzuki

Publisher
Springer Japan
Year
2010
Tongue
English
Weight
242 KB
Volume
26
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Graphs with unique minimum edge dominati
Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices
✍ 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

Graphs with given odd sets and the least
Graphs with given odd sets and the least number of vertices
✍ Louis Hakimi, S. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 64 KB πŸ‘ 2 views

This note presents a solution to the following problem posed by Chen, Schelp, and SoltΓ©s: find a simple graph with the least number of vertices for which only the degrees of the vertices that appear an odd number of times are given.

Large sets of pseudosimilar vertices
Large sets of pseudosimilar vertices
✍ Josef Lauri πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 174 KB

Perhaps the most interesting current problems in pseudosimilarity involve questions about graphs with large sets of pseudosimilar vertices or edges. We here look at some of the methods which have been employed to construct such graphs.