Computing the strong alliance polynomial of a graph
From MaRDI portal
Publication:5152645
Recommendations
Cites work
- 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
- Defensive k-alliances in graphs
- Global defensive \(k\)-alliances in graphs
- Global defensive alliances in graphs
- Graph theory
- scientific article; zbMATH DE number 2076807 (Why is no real title available?)
- scientific article; zbMATH DE number 2077650 (Why is no real title available?)
- scientific article; zbMATH DE number 2104820 (Why is no real title available?)
- Mean value for the matching and dominating polynomial
- On defensive alliances and line graphs
- On the complement graph and defensive \(k\)-alliances
- On the Convolution of Logarithmically Concave Sequences
- On the theory of the matching polynomial
- Roots of independence polynomials of well covered graphs
- Spectral study of alliances in graphs
- Upper k-alliances in graphs
Cited in
(6)
This page was built for publication: Computing the strong alliance polynomial of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5152645)