ANOTHER LOOK AT k-DOMINATION IN GRAPHS

DOI10.17654/DM019040421zbMath1425.05113OpenAlexW2898744615MaRDI QIDQ4973417

Ferdinand P. Jamil, Sergio R. jun. Canoy

Publication date: 27 November 2019

Published in: Advances and Applications in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.17654/dm019040421

zbMATH Keywords

coronaKronecker productconnected \(k\)-dominationlexicographic product\(k\)-domination

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounds on the connected \(k\)-domination number in graphs
• \(k\)-domination and \(k\)-independence in graphs: A survey
• A note on the k-domination number of a graph
• Bounds on the \(k\)-domination number of a graph
• An upper bound for thek-domination number of a graph
• Connected Domination and Spanning Trees with Many Leaves

This page was built for publication: ANOTHER LOOK AT k-DOMINATION IN GRAPHS