Some necessary conditions for graphs with extremal connected 2-domination number

DOI10.47443/DML.2023.230MaRDI QIDQ6561580zbMATH OpenFDO

Authors Piyawat Wongthongcue, Chalermpong Worawannotai

Publication date 25 June 2024

Published in DML. Discrete Mathematics Letters (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.47443/DML.2023.230

zbMATH Keywords

\(k\)-dominationconnected \(k\)-dominationconnected dominationdomination

Mathematics Subject Classification ID

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

Recommendations

• On connected k-domination in graphs
• On connected k-domination numbers of graphs.
• Bounds on the connected \(k\)-domination number in graphs
• 2-edge connected dominating sets and 2-connected dominating sets of a graph
• Nordhaus-Gaddum type results for connected domination number of graphs

Cites work

• Bounds on the connected \(k\)-domination number in graphs
• Connected p-domination in graphs
• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 3914370 (Why is no real title available?)
• scientific article; zbMATH DE number 3702724 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)

This page was built for publication: Some necessary conditions for graphs with extremal connected 2-domination number

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