Two Bounds for the Domination Number of a Graph

DOI10.1093/IMAMAT/14.2.183MaRDI QIDQ4775897zbMATH OpenOpenAlexFDO

Authors

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

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

Cited in

(21)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4775897)