Upper majority domination number of a graph

DOI10.1007/978-3-319-64419-6_26zbMATH Open1496.05133OpenAlexW2747194191MaRDI QIDQ1683554FDOQ1683554

Authors: Peng Zhang 

Publication date: 1 December 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-64419-6_26

Recommendations

• Upper whole domination in a graph
• Publication:4489228
• An upper bound on the domination number of a graph.
• Upper singed domination number of graphs
• On upper total domination versus upper domination in graphs
• scientific article; zbMATH DE number 4031749
• On majority total domination in graphs
• On majority total domination in graphs
• On majority domination in graphs
• The upper domatic number of a graph

zbMATH Keywords

majority domination numbermajority dominationupper majority domination number

Mathematics Subject Classification ID

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

Cited In (10)

• On majority total domination in graphs
• On majority total domination in graphs
• Majority domination edge critical graphs
• Signed and minus dominating functions in graphs
• Majority bad number
• Majority domination in graphs
• Majority reinforcement number
• Majority Roman domination in graphs
• On majority domination in graphs
• Some results on majority bad number

This page was built for publication: Upper majority domination number of a graph

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