The independence fractal of a graph.

DOI10.1016/S0095-8956(02)00014-XzbMath1050.05090OpenAlexW1971585316MaRDI QIDQ1405113

C. A. Hickman, Jason I. Brown, Richard J. Nowakowski

Publication date: 25 August 2003

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0095-8956(02)00014-x

zbMATH Keywords

Julia setMandelbrot setfractalindependence polynomialgraph polynomialgraph product

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Fractals (28A80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (9)

The \(k\)-fractal of a simplicial complex ⋮ Upper tails and independence polynomials in random graphs ⋮ Network reliability: Heading out on the highway ⋮ Roots of two‐terminal reliability polynomials ⋮ Graphs whose independence fractals are line segments ⋮ On the roots of independence polynomials of almost all very well-covered graphs ⋮ Independence roots and independence fractals of certain graphs ⋮ Independence polynomials of circulants with an application to music ⋮ Julia set of some graphs using independence polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The iteration of cubic polynomials. I: The global topology of parameter space
• The iteration of cubic polynomials. II: Patterns and parapatterns
• Roots of independence polynomials of well covered graphs
• Invariant sets under iteration of rational functions
• Theory of monomer-dimer systems
• Dependence polynomials
• Complex analytic dynamics on the Riemann sphere
• On the theory of the matching polynomial
• The components of a Julia set
• On chromatic roots of large subdivisions of graphs

This page was built for publication: The independence fractal of a graph.