The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination

DOI10.7151/dmgt.2134zbMath1430.05086arXiv1611.02379OpenAlexW2820219500WikidataQ129540629 ScholiaQ129540629MaRDI QIDQ2282474

David Amos, Randy Davila, John Asplund, Boris Brimkov

Publication date: 8 January 2020

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.02379

zbMATH Keywords

domination numberSlater number\(k\)-domination numberdegree sequence index strategysub-\(k\)-domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Revisiting \(k\)-tuple dominating sets with emphasis on small values of \(k\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved bounds on the domination number of a tree
• Bounds on the connected \(k\)-domination number in graphs
• A proof of the conjecture regarding the sum of domination number and average eccentricity
• A note on the k-domination number of a graph
• On \(k\)-domination and \(j\)-independence in graphs
• New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
• On the spectral radius of graphs with a given domination number
• Degree Sequence Index Strategy
• Onk-domination and minimum degree in graphs
• On the residue of a graph
• On the total k-domination number of graphs
• Lower bound on the domination number of a tree
• Total Domination in Graphs
• On the Concentration of the Domination Number of the Random Graph

This page was built for publication: The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination