The \(k\)-fractal of a simplicial complex
type: Item
instance of: scholarly article
title: The \(k\)-fractal of a simplicial complex
zbMATH Open document ID: 1113.37030
author: Jason I. Brown
author: R. J. Nowakowski
author: C. A. Hickman
published in: Discrete Mathematics
publication date: 2004-08-19T00:00:00Z
Mathematics Subject Classification ID: 37F50
Mathematics Subject Classification ID: 28A80
Mathematics Subject Classification ID: 37B99
Mathematics Subject Classification ID: 52B05
zbMATH DE Number: 2092820
zbMATH Keywords: Simplicial complex
zbMATH Keywords: \(k\)-Polynomial
zbMATH Keywords: Roots
zbMATH Keywords: \(k\)-Fractal
zbMATH Keywords: Julia set
MaRDI profile type: Publication
full work available at URL: j.disc.2003.12.014
OpenAlex ID: W2006169827
cites work: Q4040874
cites work: The components of a Julia set
cites work: Limits of chromatic zeros of some families of maps
cites work: Complex analytic dynamics on the Riemann sphere
cites work: The iteration of cubic polynomials. I: The global topology of parameter space
cites work: The iteration of cubic polynomials. II: Patterns and parapatterns
cites work: Invariant sets under iteration of rational functions
cites work: Chromatic polynomials and order ideals of monomials
cites work: Subdivisions and chromatic roots
cites work: Roots of the Reliability Polynomials
cites work: Non-Stanley bounds for network reliability
cites work: Roots of independence polynomials of well covered graphs
cites work: On chromatic roots of large subdivisions of graphs
cites work: Q5461524
cites work: On the location of roots of independence polynomials
cites work: The independence fractal of a graph.
cites work: Bounding the roots of independence polynomials.
cites work: Q4003073
cites work: Dependence polynomials
cites work: Incomparability graphs of \((3+1)\)-free posets are \(s\)-positive
cites work: Q3216703
cites work: On the theory of the matching polynomial
cites work: Q4033676
cites work: Theory of monomer-dimer systems
cites work: A (<5)-Colour Theorem for Planar Graphs
cites work: Q3226265
cites work: On the Shannon capacity of a graph
cites work: An introduction to chromatic polynomials
cites work: Q3819084
cites work: Q3898496
cites work: On a Problem of C. E. Shannon in Graph Theory
cites work: Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems.
cites work: Zeros of Reliability Polynomials and f-vectors of Matroids
cites work: Q4111952
DOI: 10.1016/J.DISC.2003.12.014
description: scientific article; zbMATH DE number 2092820