Strict majority functions on graphs

DOI<49::AID-JGT6>3.0.CO;2-F 10.1002/(SICI)1097-0118(199805)28:1<49::AID-JGT6>3.0.CO;2-FzbMath0919.05032OpenAlexW4232610793MaRDI QIDQ4242798

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<49::aid-jgt6>3.0.co;2-f

zbMATH Keywords

treeboundsopinion functionstrict majority functionstrict majority number

Mathematics Subject Classification ID

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

Related Items (8)

\(k\)-subdomination in graphs ⋮ The power of small coalitions under two-tier majority on regular graphs ⋮ Lower bounds on the minus domination and \(k\)-subdomination numbers. ⋮ Unnamed Item ⋮ Minus domination number in \(k\)-partite graphs. ⋮ Total minus domination in \(k\)-partite graphs ⋮ Dominating functions with integer values in graphs—a survey ⋮ Signed and Minus Dominating Functions in Graphs

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