𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Integral graphs and -regular sets

✍ Scribed by Paula Carvalho; Paula Rama

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
176 KB
Volume
432
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Maximum acyclic and fragmented sets in r
Maximum acyclic and fragmented sets in regular graphs
✍ Penny Haxell; Oleg Pikhurko; Andrew Thomason πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 126 KB

## Abstract We show that a typical __d__‐regular graph __G__ of order __n__ does not contain an induced forest with around ${2 {\rm In} d \over d}$ vertices, when __n__ ≫ __d__ ≫ 1, this bound being best possible because of a result of Frieze and Łuczak [6]. We then deduce an affirmative answer to

Signed Domination in Regular Graphs and
Signed Domination in Regular Graphs and Set-Systems
✍ ZoltΓ‘n FΓΌredi; Dhruv Mubayi πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 188 KB

Suppose G is a graph on n vertices with minimum degree r. Using standard random methods it is shown that there exists a two-coloring of the vertices of G with colors, +1 and &1, such that all closed neighborhoods contain more 1's than &1's, and all together the number of 1's does not exceed the numb