Two Bounds for the Domination Number of a Graph
From MaRDI portal
Publication:4775897
DOI10.1093/imamat/14.2.183zbMath0288.05124MaRDI QIDQ4775897
No author found.
Publication date: 1974
Published in: IMA Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imamat/14.2.183
05C35: Extremal problems in graph theory
05C20: Directed graphs (digraphs), tournaments
05-04: Software, source code, etc. for problems pertaining to combinatorics
Related Items
Gallai theorems for graphs, hypergraphs, and set systems, Bibliography on domination in graphs and some basic definitions of domination parameters, Chordal graphs and upper irredundance, upper domination and independence, The least point covering and domination numbers of a graph, Bounds for the covering number of a graph, On the algorithmic complexity of twelve covering and independence parameters of graphs, Strong weak domination and domination balance in a graph, Gallai-type theorems and domination parameters, On weakly connected domination in graphs, Using maximality and minimality conditions to construct inequality chains, Generalized independence and domination in graphs, Well irredundant graphs, Critical concepts in domination, Factor domination in graphs