Related papers: Triangular fractal approximating graphs and their …
The Sierpinski Triangle (ST) is a fractal mathematical structure that has been used to explore the emergence of flat bands in lattices of different geometries and dimensions in condensed matter. Here we look into fractal features in the…
Girth-regular graphs with equal girth, regular degree and chromatic index are studied for the determination of 1-factorizations with each 1-factor intersecting every girth cycle. Applications to hamiltonian decomposability and to…
In this paper, we investigate a family of graphs associated to collections of arcs on surfaces. These {\it multiarc graphs} naturally interpolate between arc graphs and flip graphs, both well studied objects in low dimensional geometry and…
We consider the intersections of fractal k-cubes of order n and intersections of their respective opposite l-faces. The main result of the paper is the theorem on representation of such intersection as the attractor of a graph-directed…
The processes of constructing some graphs from others using binary operations of union with intersection (gluing) are studied. For graph classes closed with respect to gluing operations the elemental and operational bases are introduced.…
Regular colored graphs are dual representations of pure colored D-dimensional complexes. These graphs can be classified with respect to an integer, their degree, much like maps are characterized by the genus. We analyse the structure of…
An orientation of a graph is semi-transitive if it contains no directed cycles and has no shortcuts. An undirected graph is semi-transitive if it can be oriented in a semi-transitive manner. The class of semi-transitive graphs includes…
We introduce a fractal version of the pinwheel substitution tiling. There are thirteen basic prototiles, all of which have fractal boundaries. These tiles, along with their reflections and rotations, create a tiling space which is mutually…
We consider a special type of self-similar sets, called fractal squares, and give a brief review on recent results and unsolved issues with an emphasis on their topological properties.
A circle pattern is a configuration of circles in the plane whose combinatorics is given by a planar graph G such that to each vertex of G corresponds a circle. If two vertices are connected by an edge in G, the corresponding circles…
The {\it Sierpi\'nski fractal} or {\it Sierpi\'nski gasket} $\Sigma$ is a familiar object studied by specialists in dynamical systems and probability. In this paper, we consider a graph $S_n$ derived from the first $n$ iterations of the…
In this paper are investigated strictly self-similar fractals that are composed of an infinite number of regular star-polygons, also known as Sierpinski $n$-gons, $n$-flakes or polyflakes. Construction scheme for Sierpinsky $n$-gon and…
Prime number related fractal polygons and curves are derived by combining two different aspects. One is an approximation of the prime counting function build on an additive function. The other are prime number indexed basis entities taken…
In this paper we introduce a class of hypergraphs that we call chordal. We also extend the definition of triangulated hypergraphs, given in \cite{VT}, so that a triangulated hypergraph, according to our definition, is a natural…
Random intersection graphs model networks with communities, assuming an underlying bipartite structure of groups and individuals, where these groups may overlap. Group memberships are generated through the bipartite configuration model.…
Several classical constructions illustrate the fact that the chromatic number of a graph can be arbitrarily large compared to its clique number. However, until very recently, no such construction was known for intersection graphs of…
Planar graphs are the graphs with Dushnik-Miller dimension at most three (W. Schnyder, Planar graphs and poset dimension, Order 5, 323-343, 1989). Consider the intersection graph of interior disjoint axis parallel rectangles in the plane.…
The Sierpinski tetrahedron has a remarkable property: It is projected to squares in three orthogonal directions, and moreover, to sets with positive Lebesgue measures in numerous directions. This paper proposes a method for characterizing…
Similarity notions between vertices in a graph, such as structural and regular equivalence, are one of the main ingredients in clustering tools in complex network science. We generalise structural and regular equivalences for undirected…
Triangulations of a product of two simplices and, more generally, of root polytopes are closely related to Gelfand-Kapranov-Zelevinsky's theory of discriminants, to tropical geometry, tropical oriented matroids, and to generalized…