Independent domination in regular graphs (Q1897445)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Independent domination in regular graphs |
scientific article; zbMATH DE number 790560
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Independent domination in regular graphs |
scientific article; zbMATH DE number 790560 |
Statements
Independent domination in regular graphs (English)
0 references
27 August 1995
0 references
The minimum cardinality of all maximal independent sets of vertices of a simple graph \(G\) is called its independent domination number \(i(G)\). It is proved that if \(G\) is regular if size \(n\) then \(i(G)\cdot i(\overline G)< (n+ 14)^2/12.68\).
0 references
regular graphs
0 references
independent sets
0 references
independent domination number
0 references
0.9223671555519104
0 references
0.9130194187164308
0 references
0.905518114566803
0 references
0.8865095973014832
0 references
