Related papers: Triangular fractal approximating graphs and their …
The classic Sierpinski triangle comprised of conducting bonds is multifractal. Thus the critical exponents and dimensions related to the conductivity are obtained asymptotically--that is, in the limit that the correlation length {\xi} of…
We describe a construction that takes as input a graph and a basis for its first homology, and returns a triangulation of a 3-dimensional homology sphere. This makes precise an idea of M. Gromov and A. Nabutovski. The immediate application,…
We advance the program of connections between final coalgebras as sources of circularity in mathematics and fractal sets of real numbers. In particular, we are interested in the Sierpinski carpet, taking it as a fractal subset of the unit…
Graph complements G(n) of cyclic graphs are circulant, vertex-transitive, claw-free, strongly regular, Hamiltonian graphs with a Z(n) symmetry, Shannon capacity 2 and known Wiener and Harary index. There is an explicit spectral zeta…
Kontsevich introduced certain ribbon graphs as cell decompositions for combinatorial models of moduli spaces of complex curves with boundaries in his proof of Witten's conjecture. In this work, we define four types of generalised Kontsevich…
By slight modification of the data of the Sierpinski gasket, keeping the open set condition fulfilled, we obtain self-similar sets with very dense parts, similar to fractals in nature and in random models. This is caused by a complicated…
The Burling sequence is a sequence of triangle-free graphs of increasing chromatic number. Each of them is isomorphic to the intersection graph of a set of axis-parallel boxes in $R^3$. These graphs were also proved to have other…
In this paper, we use the theory of Riordan matrices to introduce the notion of a Riordan graph. The Riordan graphs are a far-reaching generalization of the well known and well studied Pascal graphs and Toeplitz graphs, and also some other…
The Sierpi\'nski product of graphs generalises the vast and relevant class of Sierpi\'nski-type graphs, and is also related to the classic lexicographic product of graphs. Our first main results are necessary and sufficient conditions for…
Transversal structures (also known as regular edge labelings) are combinatorial structures defined over 4-connected plane triangulations with quadrangular outer-face. They have been intensively studied and used for many applications…
We characterise the quotient surface graphs arising from symmetric contact systems of line segments in the plane and also from symmetric pointed pseudotriangulations in the case where the group of symmetries is generated by a translation or…
Starting with a substitution tiling, we demonstrate a method for constructing infinitely many new substitution tilings. Each of these new tilings is derived from a graph iterated function system and the tiles have fractal boundary. We show…
Rectangulations are partitions of a square into axis-aligned rectangles. A number of results provide bijections between combinatorial equivalence classes of rectangulations and families of pattern-avoiding permutations. Other results deal…
We investigate circular planar nearrings constructed from finite fields as well the complex number field using a multiplicative subgroup of order $k$, and characterize the overlaps of the basic graphs which arise in the associated…
Fractal geometry is the study of sets which exhibit the same pattern at multiple scales. Developing tools to study these sets is of great interest. One step towards developing some of these tools is recognizing the duality between…
This study proposes a method for producing an infinite number of fractals using aperiodic substitution tilings, exemplified by the Ammann Chair tiling. Higher-order substitutions of aperiodic tilings are utilized in relation to the…
Symmetrically self-similar graphs are an important type of fractal graph. Their Green functions satisfy order one iterative functional equations. We show when the branching number of a generating cell is two, either the graph is a star…
Given a graph and a representation of its fundamental group, there is a naturally associated twisted adjacency operator. The main result of this article is the fact that these operators behave in a controlled way under graph covering maps.…
In this article, we considered a fractal image as a fractal curve, that is, as a walk on a grid in Euclidean space $\R^d$. We placed integers on the generating vectors of a grid, such that opposite directions have opposite numbers. This…
This paper presents a detailed symbolic approach to the study of self-similar tilings. It uses properties of addresses associated with graph-directed iterated function systems to establish conjugacy properties of tiling spaces. Tiles may be…