𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Domination in quadrangle-free helly graphs

✍ Scribed by F. F. Dragan

Publisher
Springer US
Year
1994
Tongue
English
Weight
705 KB
Volume
29
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

M-degrees of quadrangle-free planar grap
M-degrees of quadrangle-free planar graphs
✍ Oleg V. Borodin; Alexandr V. Kostochka; Naeem N. Sheikh; Gexin Yu πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 101 KB πŸ‘ 2 views

## Abstract The __M‐degree__ of an edge __xy__ in a graph is the maximum of the degrees of __x__ and __y__. The __M‐degree__ of a graph __G__ is the minimum over __M__‐degrees of its edges. In order to get upper bounds on the game chromatic number, He et al showed that every planar graph __G__ with

Paired-Domination inP5-Free Graphs
Paired-Domination inP5-Free Graphs
✍ Paul Dorbec; Sylvain Gravier πŸ“‚ Article πŸ“… 2008 πŸ› Springer Japan 🌐 English βš– 189 KB
Upper total domination in claw-free grap
Upper total domination in claw-free graphs
✍ Odile Favaron; Michael A. Henning πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 114 KB

## 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__ (other than itself). The maximum cardinality of a minimal total dominating set of __G__ is the upper total domination number of __G__, denoted by Ξ“~__