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

No Cycling in the Graphs!

โœ Scribed by Lowell W. Beineke; Robert C. Vandell

Book ID
104444132
Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
257 KB
Volume
11
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Graphs whose neighborhoods have no speci
Graphs whose neighborhoods have no special cycles
โœ A.E. Brouwer; P. Duchet; A. Schrijver ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 480 KB

To a graph G is canonically associated its neighborhood-hypergraph, X(G), formed by the closed neighborhoods of the vertices of G. We characterize the graphs G such that (i) X(G) has no induced cycle, or (ii) #(G) is a balanced hypergraph or (iii) X(G) is triangle free. (i) is another short proof of

Regular Graphs with No Homomorphisms ont
Regular Graphs with No Homomorphisms onto Cycles
โœ I.M. Wanless; N.C. Wormald ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 97 KB

We prove the existence of d-regular graphs with arbitrarily large girth and no homomorphism onto the cycle C s , where (d, s)=(3, 9) and (4, 5).

Total domination in 2-connected graphs a
Total domination in 2-connected graphs and in graphs with no induced 6-cycles
โœ Michael A. Henning; Anders Yeo ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 272 KB ๐Ÿ‘ 1 views

## Abstract A set __S__ of vertices in a graph __G__ is a total dominating set of __G__ if every vertex of __G__ is adjacent to some vertex in __S__. The minimum cardinality of a total dominating set of __G__ is the total domination number ฮณ~t~(__G__) of __G__. It is known [J Graph Theory 35 (2000)