A bound on the values of independence polynomials at \(-1/k\) for \(k\)-degenerate graphs (Q385733): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The number of labeled k-dimensional trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The roots of the independence polynomial of a clawfree graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3043192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3807048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique polynomials and independent set polynomials of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3340886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cyclomatic number of a graph and its independence polynomial at \(- 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3377673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>k</i>-Degenerate Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3931424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence polynomials of \(k\)-tree related graphs / rank
 
Normal rank

Revision as of 02:45, 7 July 2024

scientific article
Language Label Description Also known as
English
A bound on the values of independence polynomials at \(-1/k\) for \(k\)-degenerate graphs
scientific article

    Statements

    A bound on the values of independence polynomials at \(-1/k\) for \(k\)-degenerate graphs (English)
    0 references
    0 references
    0 references
    0 references
    3 December 2013
    0 references
    Fibonacci number of a graph
    0 references
    independence polynomials
    0 references
    \(k\)-trees
    0 references
    \(k\)-degenerate graphs
    0 references

    Identifiers