On domination and independence numbers of graphs (Q1813991)
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: On domination and independence numbers of graphs |
scientific article; zbMATH DE number 5551
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On domination and independence numbers of graphs |
scientific article; zbMATH DE number 5551 |
Statements
On domination and independence numbers of graphs (English)
0 references
25 June 1992
0 references
The authors characterize those graphs which (1) have equal domination and independence numbers, and (2) are either bipartite or are block graphs, i.e., graphs in which every block is a complete graph.
0 references
domination number
0 references
independence number
0 references
block graphs
0 references
