Representation and generation of graphs using iterated function systems

DOI10.1016/S0893-9659(97)00038-4MaRDI QIDQ1372273zbMATH OpenFDO

Authors D. J. Nettleton

Publication date 12 November 1997

Published in Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0893-9659(97)00038-4

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Fixed-point and coincidence theorems (topological aspects) (54H25)

Review text

The author shows that iterated function systems (IFS) can be used to represent and generate graphs.

Cites work

• scientific article; zbMATH DE number 194082 (Why is no real title available?)
• scientific article; zbMATH DE number 1350003 (Why is no real title available?)
• Using iterated function systems to model discrete sequences

Cited in

(4)

• Graphs induced by iterated function systems
• A functional approach to the representation of graphs
• Representation of discrete sequences with \(N\)-dimensional iterated function systems in tensor form
• Representation of discrete sequences with high-dimensional iterated function systems

This page was built for publication: Representation and generation of graphs using iterated function systems

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