On the maximal independence polynomial of certain graph configurations
From MaRDI portal
(Redirected from Publication:680338)
Recommendations
- On the coefficients of the independence polynomial of graphs
- On the number of maximum independent sets of graphs
- On the number of maximal independent sets in a graph
- Optimal graphs for independence and \(k\)-independence polynomials
- On the independence number of graphs related to a polarity
- On the independence polynomials of path-like graphs
- On the independent domination polynomial of a graph
- On the maximum number of maximum independent sets in connected graphs
- The number of maximum independent sets in graphs
- GENERALISED MAXIMAL INDEPENDENCE AND CLIQUE NUMBERS OF GRAPHS
Cited in
(11)- Derandomized Concentration Bounds for Polynomials, and Hypergraph Maximal Independent Set
- On degree based topological indices of bridge graphs
- Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs
- On the maximal independence polynomial of the covering graph of the hypercube up to \(n=6\)
- Maximum modulus of independence roots of graphs and trees
- On maximum graphs in Tutte polynomial posets
- Atom probe tomography characterization of solute segregation to dislocations and interfaces
- On the coefficients of the independence polynomial of graphs
- An algorithm for calculating the independence and vertex-cover polynomials of a graph
- A sufficient condition to extend polynomial results for the maximum independent set problem
- On the independence polynomial of an antiregular graph
This page was built for publication: On the maximal independence polynomial of certain graph configurations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q680338)
