Strict majority functions on graphs

DOI10.1002/(SICI)1097-0118(199805)28:1%3C49::AID-JGT6%3E3.0.CO;2-FMaRDI QIDQ4242798zbMATH OpenOpenAlexFDO

Authors Michael A. Henning, Hugh Hind

Publication date 11 May 1999

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199805)28:1%3C49::aid-jgt6%3E3.0.co;2-f

zbMATH Keywords

boundsopinion functionstrict majority functionstrict majority numbertree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Recommendations

• Opinion functions on trees
• Majority domination in graphs
• scientific article; zbMATH DE number 6889673
• scientific article; zbMATH DE number 1124597

Cited in

(10)

• Opinion functions on trees
• The majority strategy on graphs
• Lower bounds on the minus domination and \(k\)-subdomination numbers.
• Minus domination number in \(k\)-partite graphs.
• k-subdomination in graphs
• Total minus domination in \(k\)-partite graphs
• Signed and minus dominating functions in graphs
• Dominating functions with integer values in graphs—a survey
• Bounds of the signed edge domination number of complete multipartite graphs
• The power of small coalitions under two-tier majority on regular graphs

This page was built for publication: Strict majority functions on graphs

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