Roots of independence polynomials of well covered graphs (Q1577528): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Jason I. Brown / rank
Normal rank
 
Property / author
 
Property / author: Karl Dilcher / rank
Normal rank
 
Property / author
 
Property / author: Q186124 / rank
Normal rank
 
Property / author
 
Property / author: Jason I. Brown / rank
 
Normal rank
Property / author
 
Property / author: Karl Dilcher / rank
 
Normal rank
Property / author
 
Property / author: Richard J. Nowakowski / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5558293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3835498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Eneström-Kakeya theorem and its sharpness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roots of the Reliability Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the log concavity of reliability and matroidal sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818315 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Unimodality for Linear Extensions of Partial Orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4769056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the number of triangles in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the number of complete subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dependence polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the theory of the matching polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3988150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4285380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4033676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3043192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the numbers of independent \(k\)-sets in a claw free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3879185 / 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: On the unimodality of the independent set numbers of a class of matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalization of a Theorem of Bôcher / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial invariants of graphs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some covering concepts in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: WELL-COVERED GRAPHS: A SURVEY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3819084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two combinatorial applications of the Aleksandrov-Fenchel inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5641146 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1023/a:1008705614290 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1509680213 / rank
 
Normal rank

Latest revision as of 08:49, 30 July 2024

scientific article
Language Label Description Also known as
English
Roots of independence polynomials of well covered graphs
scientific article

    Statements

    Roots of independence polynomials of well covered graphs (English)
    0 references
    10 October 2002
    0 references
    well covered graph
    0 references
    independent sets
    0 references
    independence polynomial
    0 references
    0 references
    0 references
    0 references

    Identifiers