Upper bounds on the coalition number

MaRDI QIDQ5000323zbMATH OpenFDO

Authors Teresa W. Haynes, Stephen T. Hedetniemi, Alice A. McRae, Raghuveer Mohan, Jason Hedetniemi

Publication date 12 July 2021

Full work available at URL http://ajc.maths.uq.edu.au/pdf/80/ajc_v80_p442.pdf

zbMATH Keywords

minimum degreedominating setmaximum degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

Recommendations

• Introduction to coalitions in graphs
• On the coalition number of trees
• Self-coalition graphs
• Tight upper bounds for the domination numbers of graphs with given order and minimum degree. II
• scientific article; zbMATH DE number 5972305

Cites work

• Introduction to coalitions in graphs
• Upper bounds on the coalition number

Cited in

(12)

• The power of small coalitions in graphs
• Self-coalition graphs
• A characterization of graphs with given total coalition numbers
• Independent coalition in graphs: existence and characterization
• Introduction to coalitions in graphs
• On cubic graphs having the maximum coalition number
• Transversal coalitions in hypergraphs
• Total coalitions in graphs
• Upper bounds on the coalition number
• Coalition graphs
• On the coalition number of trees
• Singleton coalition graph chains

This page was built for publication: Upper bounds on the coalition number

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