Contributions to the theory of domination, independence and irredundance in graphs

DOI10.1016/0012-365X(81)90268-5zbMath0471.05051MaRDI QIDQ1157348

S. H. Smith

Publication date: 1981

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

independence number; domination number; lower and upper irredundance numbers

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Related Items

Irredundancy in circular arc graphs, A note on graphs which have upper irredundance equal to independence, Chordal graphs and upper irredundance, upper domination and independence, The product of the independent domination numbers of a graph and its complement, On minimum maximal independent sets of a graph, Minus domination in graphs, On the differences between the upper irredundance, upper domination and independence numbers of a graph, On independent domination number of regular graphs, An upper bound for the independent domination number, The sequence of upper and lower domination, independence and irredundance numbers of a graph, Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance, Domination and irredundance in cubic graphs, Gallai-type theorems and domination parameters, On weakly connected domination in graphs, Irredundance in grids, Interpolation theorems for graphs, hypergraphs and matroids, Upper domination and upper irredundance perfect graphs, Inequalities relating domination parameters in cubic graphs, Irredundance perfect graphs, The algorithmic complexity of minus domination in graphs, The complexity of irredundant sets parameterized by size