On the maximal independence polynomial of certain graph configurations
DOI10.1216/RMJ-2017-47-7-2219zbMATH Open1378.05095MaRDI QIDQ680338FDOQ680338
Chunwei Song, Toufik Mansour, Han Hu
Publication date: 23 January 2018
Published in: Rocky Mountain Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.rmjm/1514084426
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
Graph polynomials (05C31) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Trigonometric polynomials, inequalities, extremal problems (42A05)
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\)
- On maximum graphs in Tutte polynomial posets
- Maximum modulus of independence roots of graphs and trees
- 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
- On the independence polynomial of an antiregular graph
- A sufficient condition to extend polynomial results for the maximum independent set problem
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)
