Distinctive power of the alliance polynomial for regular graphs

DOI10.1016/J.ENDM.2014.08.041MaRDI QIDQ283733zbMATHOpenAlexFDO

Authors Walter Carballosa, José M. Rodríguez, Yadira Torres-Nuñez, Jose M. Sigarreta

Publication date 13 May 2016

Full work available at URL https://doi.org/10.1016/j.endm.2014.08.041

zbMATH Keywords

finite graphsalliance polynomialsdefensive alliancesregular graphs

Mathematics Subject Classification ID

Graph polynomials (05C31)

Recommendations

• Alliance polynomial of regular graphs
• Computing the alliance polynomial of a graph.
• Defensive alliance polynomial
• Computing the strong alliance polynomial of a graph
• scientific article; zbMATH DE number 6475954

Cites work

• scientific article; zbMATH DE number 3836093 (Why is no real title available?)
• A Contribution to the Theory of Chromatic Polynomials
• An introduction to chromatic polynomials
• An introduction to matching polynomials
• Characterization of graphs using domination polynomials
• Clique polynomials and independent set polynomials of graphs
• Mean value for the matching and dominating polynomial
• On the theory of the matching polynomial
• On the zeros of domination polynomial of a graph
• Roots of independence polynomials of well covered graphs

Cited in

(5)

• Computing the strong alliance polynomial of a graph
• Saturated boundary \(k\)-alliances in graphs
• On the differential polynomial of a graph
• Alliance polynomial of regular graphs
• Computing the alliance polynomial of a graph.

This page was built for publication: Distinctive power of the alliance polynomial for regular graphs

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