A new characterization of paired domination number of a graph

DOI10.1007/978-3-642-28926-2_10MaRDI QIDQ5867211zbMATH OpenOpenAlexFDO

Authors

Publication date 13 September 2022

Published in Mathematical Modelling and Scientific Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-28926-2_10

zbMATH Keywords

chromatic numberpaired domination number

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 6522554
• scientific article; zbMATH DE number 1185309
• All graphs with paired-domination number two less than their order
• Paired-domination in graphs
• Well paired-dominated graphs

Cites work

• scientific article; zbMATH DE number 5621287 (Why is no real title available?)
• scientific article; zbMATH DE number 3159208 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 1743834 (Why is no real title available?)
• The Two-Triangle Case of the Acquaintance Graph

Cited in

(4)

• scientific article; zbMATH DE number 5917640 (Why is no real title available?)
• scientific article; zbMATH DE number 6522554 (Why is no real title available?)
• scientific article; zbMATH DE number 1185309 (Why is no real title available?)
• Paired-domination in graphs

This page was built for publication: A new characterization of paired domination number of a graph

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