Maximum modulus of independence roots of graphs and trees (Q2175814): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the stability of independence polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the unimodality of independence polynomials of very well-covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roots of the Reliability Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roots of independence polynomials of well covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the location of roots of independence polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the roots of all-terminal reliability polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the roots of domination polynomials / 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: Note on the Smallest Root of the Independence Polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the roots of edge cover polynomials of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Very well covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of well covered graphs of girth 5 or greater / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3043192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of maximum independent sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the roots of independence polynomials of almost all very well-covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the location of roots of graph polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical graph isomorphism. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4568161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some covering concepts in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Brown-Colbourn conjecture on zeros of reliability polynomials is false / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Independent Sets in Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic Roots are Dense in the Whole Complex Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Maximal Independent Sets in a Tree / rank
 
Normal rank

Latest revision as of 14:11, 22 July 2024

scientific article
Language Label Description Also known as
English
Maximum modulus of independence roots of graphs and trees
scientific article

    Statements

    Maximum modulus of independence roots of graphs and trees (English)
    0 references
    0 references
    0 references
    30 April 2020
    0 references
    0 references
    independence polynomial
    0 references
    root
    0 references
    maximum modulus
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references