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

DOI10.47443/DML.2023.230MaRDI QIDQ6561580FDOQ6561580

Authors: Piyawat Wongthongcue, Chalermpong Worawannotai 

Publication date: 25 June 2024

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

zbMATH Keywords

dominationconnected domination\(k\)-dominationconnected \(k\)-domination

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bounds on the connected \(k\)-domination number in graphs
• Connected \(p\)-domination in graphs

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)