Inequalities relating domination parameters in cubic graphs
From MaRDI portal
Publication:1815314
DOI10.1016/0012-365X(96)00025-8zbMath0858.05058OpenAlexW2060057061WikidataQ127174068 ScholiaQ127174068MaRDI QIDQ1815314
Peter J. Slater, Michael A. Henning
Publication date: 23 March 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(96)00025-8
inequalitiesinvariantsindependence numberregular graphscubic graphsdominationdomination numberirredundance number
Related Items (42)
\(k\)-subdomination in graphs ⋮ Domination and irredundance in cubic graphs ⋮ Unnamed Item ⋮ Minus domination in regular graphs ⋮ Bounds on the signed domatic number ⋮ Domination chain: characterisation, classical complexity, parameterised complexity and approximability ⋮ Upper bounds on the signed (\(k, k\))-domatic number ⋮ Domination versus independent domination in graphs of small regularity ⋮ Lower bounds on the minus domination and \(k\)-subdomination numbers. ⋮ Complexity of majority monopoly and signed domination problems ⋮ The signed \(k\)-domination number of directed graphs ⋮ The many facets of upper domination ⋮ On the signed domination number of some Cayley graphs ⋮ Unnamed Item ⋮ Minus domination number in \(k\)-partite graphs. ⋮ Signed total domination in graphs. ⋮ The difference between the domination number and the minus domination number of a cubic graph ⋮ Upper signed domination number ⋮ Upper minus total domination in small-degree regular graphs ⋮ Lower bounds on the signed (total) $k$-domination number ⋮ Discrepancy and signed domination in graphs and hypergraphs ⋮ Total minus domination in \(k\)-partite graphs ⋮ Minus domination number in cubic graph ⋮ On the Complexity Landscape of the Domination Chain ⋮ A note on the independent domination number of subset graph ⋮ Dominating functions with integer values in graphs—a survey ⋮ Bounds on Laplacian eigenvalues related to total and signed domination of graphs ⋮ Irredundance ⋮ Signed and Minus Dominating Functions in Graphs ⋮ Upper Domination: Complexity and Approximation ⋮ Some remarks on domination in cubic graphs ⋮ Signed domination in regular graphs ⋮ Unnamed Item ⋮ The signed domatic number of some regular graphs ⋮ Some remarks on the signed domatic number of graphs with small minimum degree ⋮ Signed total domination in nearly regular graphs ⋮ Signed domatic number of a graph ⋮ A note on the lower bounds of signed domination number of a graph ⋮ On the differences between the upper irredundance, upper domination and independence numbers of a graph ⋮ Signed domination in regular graphs and set-systems ⋮ Twin signed k-domination numbers in directed graphs ⋮ A note on domination and minus domination numbers in cubic graphs
Cites Work
- What is the difference between the domination and independent domination numbers of a cubic graph?
- Contributions to the theory of domination, independence and irredundance in graphs
- Chordal graphs and upper irredundance, upper domination and independence
- Minus domination in graphs
- Some remarks on domination in cubic graphs
- Properties of Hereditary Hypergraphs and Middle Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Inequalities relating domination parameters in cubic graphs
