Related papers: Triangular fractal approximating graphs and their …
We define special Hamiltonian-paths and special permutations of the up-facing dark tiles on a checked triangular grid related to the generalized Sierpi\'{n}ski Gasket. Our definitions and observations make possible the generalization of the…
The family of Generalised Sierpinski triangles consist of the classical Sierpinski triangle, the previously well investigated Pedal triangle and two new triangular shaped fractal objects denoted by $\triangle FNN$ and $\triangle FFN$. All…
By examining arithmetic operations between decimal numbers in a given base m we uncover fractal structures that generalize the Sierpinski triangle
The family of cycle completable graphs has several cryptomorphic descriptions, the equivalence of which has heretofore been proven by a laborious implication-cycle that detours through a motivating matrix completion problem. We give a…
Some families of graphs, such as the n-cubes and Sierpinski gaskets, are self-similar. In this paper we show how such recursive structure can be used systematically to prove isoperimetric theorems.
The space of topological decompositions into triangulations of a surface has a natural graph structure where two triangulations share an edge if they are related by a so-called flip. This space is a sort of combinatorial Teichm\"uller space…
Building upon [1], this study aims to introduce fractal geometry into graph theory, and to establish a potential theoretical foundation for complex networks. Specifically, we employ the method of substitution to create and explore…
The Brattelli diagram associated with a given bicolored Dynkin-Coxeter graph of type $A_n$ determines planar fractal sets obtained by infinite dissections of a given triangle. All triangles appearing in the dissection process have angles…
We consider two families of planar self-similar tilings of different nature: the tilings consisting of translated copies of the fractal sets defined by an iterated function system, and the tilings obtained as a geometrical realization of a…
For self-similar fractals, the Minkowski content and fractal curvature have been introduced as a suitable limit of the geometric characteristics of its parallel sets, i.e., of uniformly thin coatings of the fractal. For some self-conformal…
We exhibit a characteristic structure of the class of all regular graphs of degree d that stems from the spectra of their adjacency matrices. The structure has a fractal threadlike appearance. Points with coordinates given by the mean and…
Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…
We investigate the iterative construction of discrete Laplacians on 2D square lattices, revealing emergent fractal-like patterns shaped by modular arithmetic. While classical 2222-style iterations reproduce known structures such as the…
In `A survey of two-graphs' \cite{Sei}, J.J. Seidel lays out the connections between simple graphs, two-graphs, equiangular lines and strongly regular graph. It is well known that there is a one-to-one correspondence between regular…
In this paper, we present high-level overviews of tile-based self-assembling systems capable of producing complex, infinite, aperiodic structures known as discrete self-similar fractals. Fractals have a variety of interesting mathematical…
There is a class of graphs with well-covered dimension equal to the simplicial clique number that contains all chordal graphs and infinitely many other graphs. These graphs generalize a result by Brown and Nowakowski on the well-covered…
We describe various kaleidoscopic and self-similar aspects of the integral Apollonian gaskets - fractals consisting of close packing of circles with integer curvatures. Self-similar recursive structure of the whole gasket is shown to be…
In this short note, we merge the areas of hypercomplex algebras with that of fractal interpolation and approximation. The outcome is a new holistic methodology that allows the modelling of phenomena exhibiting a complex self-referential…
The purpose of this paper is to exhibit infinite families of conjugate projective curves in a number field whose complement have the same abelian fundamental group, but are non-homeomorphic. In particular, for any $d>3$ we find Zariski…
This paper presents the graphic representation in the z-plane of the first three iterations of the algorithm that generates the Sierpinski Gasket. It analyzes the influence of the f(z) map when we represent fractal images.