𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Strong and Weak Domination, Full Sets and Domination Balance in Semigraphs

✍ Scribed by S.S. Kamath; Saroja R. Hebbar

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
86 KB
Volume
15
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Strong and weak domination in graphs
Strong and weak domination in graphs
✍ V. Swaminathan; P. Thangaraju πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 168 KB
Independent perfect domination sets in C
Independent perfect domination sets in Cayley graphs
✍ Jaeun Lee πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 92 KB πŸ‘ 1 views

## Abstract In this paper, we show that a Cayley graph for an abelian group has an independent perfect domination set if and only if it is a covering graph of a complete graph. As an application, we show that the hypercube __Q~n~__ has an independent perfect domination set if and only if __Q~n~__ i

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