Upper bounds on the coalition number

zbMATH Open1468.05208MaRDI QIDQ5000323FDOQ5000323

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

Publication date: 12 July 2021

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

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

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)

Cites Work

• Introduction to coalitions in graphs
• Title not available (Why is that?)

Cited In (10)

• The power of small coalitions in graphs
• Self-coalition graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• A characterization of graphs with given total coalition numbers
• Independent coalition in graphs: existence and characterization
• Transversal coalitions in hypergraphs
• Total coalitions in 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)