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

Independent domination in chordal graphs

โœ Scribed by Martin Farber

Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
460 KB
Volume
1
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Chordal graphs and upper irredundance, u
Chordal graphs and upper irredundance, upper domination and independence
โœ Michael S. Jacobson; Ken Peters ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 648 KB

In this paper we consider the following parameters: IR(G), the upper irredundance number, which is the order of the largest maximal irredundant set, I'(G), the upper domination number, which is the order of the largest minimal dominating set and /3(G), the independence number, which is the order of

Dominating cliques in chordal graphs
Dominating cliques in chordal graphs
โœ Dieter Kratsch; Peter Damaschke; Anna Lubiw ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 492 KB

A chordal graph has a dominating clique iff it has diameter at most 3. A strongly chordal graph which has a dominating clique has one as small as the smallest dominating set-and, furthermore, there is a linear-time algorithm to find such a small dominating clique.

Independent domination in regular graphs
Independent domination in regular graphs
โœ Julie Haviland ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 387 KB

Let G be a simple graph of order n. The independent domination number i(G) is defined to be the minimum cardinality among all maximal independent sets of vertices of G. Motivated by work of Cockayne et al. (1991) and Cockayne and Mynhardt (1989), we investigate the maximum value of the product of th