scientific article; zbMATH DE number 3950568

MaRDI QIDQ3720629zbMATH OpenFDO

Authors Jorge L. Arocha

Publication date 1984

zbMATH Keywords

independence polynomialindependent set of verticesrandom graphrecurrence formula

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Recommendations

• On the roots of expected independence polynomials
• Average independence polynomials
• On the rational independence roots
• Clique polynomials and independent set polynomials of graphs
• Independence polynomials of some compound graphs

Cited in

(18)

• Log-concavity of some independence polynomials via a partial ordering
• The roller-coaster conjecture revisited
• On the unimodality of independence polynomials of very well-covered graphs
• \(r\)-stable hypersimplices
• Bipartition polynomials, the Ising model, and domination in graphs
• On the roots of independence polynomials of almost all very well-covered graphs
• Dependence polynomials
• The number of quasi-trees in fans and wheels
• Independence equivalence classes of paths and cycles
• Independent sets on path-schemes
• Independence polynomial and matching polynomial of the Koch network
• Distance independence polynomial of graphs
• Independence-preserving operations: effects in polynomial representations
• Iterative methods in computing independence and matching polynomials of 4-regular 4-connected planar graphs
• The independence polynomial of trees is not always log-concave starting from order 26
• Independence polynomials of 2-step nilpotent Lie algebras
• A novel collocation-based numerical method for higher-order linear ODE systems with pharmacokinetic applications
• The independence polynomial of rooted products of graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3720629)