Independence polynomials of k-tree related graphs
From MaRDI portal
Publication:972329
DOI10.1016/J.DAM.2010.01.002zbMATH Open1219.05133OpenAlexW2004582013MaRDI QIDQ972329FDOQ972329
Authors: Lanzhen Song, William Staton, Bing Wei
Publication date: 25 May 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.01.002
Recommendations
- A bound on the values of independence polynomials at \(-1/k\) for \(k\)-degenerate graphs
- On the coefficients of the independence polynomial of graphs
- A characterization of trees for a new lower bound on the \(k\)-independence number
- On the largest real root of independence polynomials of trees.
- scientific article; zbMATH DE number 3882467
Graph polynomials (05C31) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- A partial k-arboretum of graphs with bounded treewidth
- Title not available (Why is that?)
- Title not available (Why is that?)
- k-Degenerate Graphs
- Clique polynomials and independent set polynomials of graphs
- The roots of the independence polynomial of a clawfree graph
- On acyclic simplicial complexes
- The number of labeled k-dimensional trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Merrifield-Simmons index of trees
- Toughness and Hamiltonicity in \(k\)-trees
Cited In (15)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sharp bounds of the Zagreb indices of \(k\)-trees
- A bound on the values of independence polynomials at \(-1/k\) for \(k\)-degenerate graphs
- Independence polynomials of some compound graphs
- On maximum Estrada indices of \(k\)-trees
- Independence polynomials of bipartite graphs
- Independent vertex sets in the Zykov sum
- Title not available (Why is that?)
- On the coefficients of the independence polynomial of graphs
- On the signless Laplacian spectra of \(k\)-trees
- Domination polynomials of \(k\)-tree related graphs
- Independence number of graphs and line graphs of trees by means of omega invariant
- Multiplicative Zagreb indices of \(k\)-trees
- On maximum signless Laplacian Estrada indices of \(k\)-trees
This page was built for publication: Independence polynomials of \(k\)-tree related graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972329)