A new characterization of paired domination number of a graph

DOI10.1007/978-3-642-28926-2_10zbMATH Open1494.05086OpenAlexW2139365506MaRDI QIDQ5867211FDOQ5867211

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

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

zbMATH Keywords

chromatic numberpaired domination number

Mathematics Subject Classification ID

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

Cites Work

• The Two-Triangle Case of the Acquaintance Graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• Paired-domination in graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)