Two Bounds for the Domination Number of a Graph

DOI10.1093/imamat/14.2.183zbMath0288.05124OpenAlexW2108014398MaRDI 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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (21)

Strong weak domination and domination balance in a graph ⋮ Gallai-type theorems and domination parameters ⋮ On weakly connected domination in graphs ⋮ Partial degree bounded edge packing problem for graphs and \(k\)-uniform hypergraphs ⋮ Factor domination in graphs ⋮ Well irredundant graphs ⋮ Using maximality and minimality conditions to construct inequality chains ⋮ Laplacian distribution and domination ⋮ MATHEMATICAL MODELLING AND SIMULATION OF FINGERPRINT ANALYSIS USING GRAPH ISOMORPHISM, DOMINATION, AND GRAPH PEBBLING ⋮ Majorization and the minimum number of dominating sets ⋮ Chordal graphs and upper irredundance, upper domination and independence ⋮ The least point covering and domination numbers of a graph ⋮ The limit case of a domination property ⋮ Critical concepts in domination ⋮ Bounds for the covering number of a graph ⋮ Global Domination ⋮ Inverse vertex covering number of a graph ⋮ On the algorithmic complexity of twelve covering and independence parameters of graphs ⋮ Generalized independence and domination in graphs ⋮ Gallai theorems for graphs, hypergraphs, and set systems ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters

This page was built for publication: Two Bounds for the Domination Number of a Graph