Majority sets in graphs

DOI10.22049/CCO.2025.30739.2602MaRDI QIDQ7323596zbMATH OpenFDO

Authors Mustapha Chellali, Stephen T. Hedetniemi, Nacéra Meddah

Publication date 1 September 2026

Published in Communications in Combinatorics and Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution-ShareAlike 4.0 International

Full work available at URL https://doi.org/10.22049/CCO.2025.30739.2602

Mathematics Subject Classification ID

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

Cites work

• -domination
• Algorithmic approach to the satisfactory graph partitioning problem
• Bounds on cost effective domination numbers
• Client-server and cost effective sets in graphs
• Cost effective domination in graphs
• Global alliances in planar graphs
• Global defensive alliances in graphs
• scientific article; zbMATH DE number 4191687 (Why is no real title available?)
• scientific article; zbMATH DE number 1208728 (Why is no real title available?)
• scientific article; zbMATH DE number 1933255 (Why is no real title available?)
• Minority sets in graphs
• On an upper bound of the graph's chromatic number, depending on the graph's degree and density
• Properties of Hereditary Hypergraphs and Middle Graphs
• Quorum colorings of graphs
• Some remarks on alpha-domination
• Structures of domination in graphs
• The alliance partition number of grid graphs
• The private neighbor concept
• The satisfactory partition problem
• Unfriendly partitions of a graph
• Using maximality and minimality conditions to construct inequality chains
• Very cost effective bipartitions in graphs

This page was built for publication: Majority sets in graphs

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