Related papers: Classification of Graph Fractaloids

We show that every interval in the homomorphism order of finite undirected graphs is either universal or a gap. Together with density and universality this "fractal" property contributes to the spectacular properties of the homomorphism…

By appropriate choices of elements in the underlying iterated function system, methodology of fractal interpolation entitles one to associate a family of continuous self-referential functions with a prescribed real-valued continuous…

In communication networks, the binding numbers of graphs (or networks) are often used to measure the vulnerability and robustness of graphs (or networks). Furthermore, the fractional factors of graphs and the fractional…

We consider an optical diffraction grating in which the spatial distribution of open slits forms a fractal set. The Fraunhofer diffraction patterns through the fractal grating are obtained analytically for the simplest triad Cantor type and…

This article is devoted to sets having the Moran structure. The main attention is given to topological, metric, and fractal properties of certain sets whose elements have restrictions on using digits or combinations of digits in own…

Given a real $n \times m$ matrix $B$, its operator norm can be defined as $$|B|=\max_{|v|=1}|Bv|.$$ We consider a matrix "small" if it has non-negative integer entries and its operator norm is less than $2$. These matrices correspond to…

For a graph $G$, let $\sigma_{2}(G)$ be the minimum degree sum of two non-adjacent vertices in $G$. A chord of a cycle in a graph $G$ is an edge of $G$ joining two non-consecutive vertices of the cycle. In this paper, we prove the following…

In this paper, we explore some significant properties associated with a fractal operator on the space of all continuous functions defined on the Sierpi\'nski Gasket (SG). We also provide some results related to constrained approximation…

We provide an explicit construction that allows one to easily decompose a graph braid group as a graph of groups. This allows us to compute the braid groups of a wide range of graphs, as well as providing two general criteria for a graph…

We give the first example of a connected 4-regular graph whose Laplace operator's spectrum is a Cantor set, as well as several other computations of spectra following a common ``finite approximation'' method. These spectra are simple…

Associative spectra of graph algebras are examined with the help of homomorphisms of DFS trees. Undirected graphs are classified according to the associative spectra of their graph algebras; there are only three distinct possibilities:…

Let $G=(V(G), E(G))$ be a graph with vertex set $V(G)$ and edge set $E(G)$. A graph is $ID$-factor-critical if for every independent set $I$ of $G$ whose size has the same parity as $|V(G)|$, $G-I$ has a perfect matching. For two positive…

A graph $G$ is primarily orientable if it is possible to orient its edges in such a way that the resulting oriented graph is prime, i.e., indecomposable under modular decomposition. We characterize primarily orientable graphs.

The square of a graph $G$, denoted by $G^2$, is obtained from $G$ by putting an edge between two distinct vertices whenever their distance is two. Then $G$ is called a square root of $G^2$. Deciding whether a given graph has a square root…

In the present article, topological, metric, and fractal properties of certain sets are investigated. These sets are images of sets whose elements have restrictions on using digits or combinations of digits in own s-adic representations,…

We consider the fractal characteristic of the quantum mechanical paths and we obtain for any universal class of fractons labeled by the Hausdorff dimension defined within the interval 1$ $$ < $$ $$h$$ $$ <$$ $$ 2$, a fractal distribution…

Graphs are commonly used to represent objects, such as images and text, for pattern classification. In a dynamic world, an object may continuously evolve over time, and so does the graph extracted from the underlying object. These changes…

Let $\mathbb{G}_{n,\alpha}$ be the set of connected graphs with order $n$ and independence number $\alpha$. Given $k=n-\alpha$, the graph with minimum spectral radius among $\mathbb{G}_{n,\alpha}$ is called the minimizer graph.…

We study a family of fractional integral operators whose kernels satisfying an non-isotropic dilation have singularity on a coordinate subspace. A characterization is given for these operators bounded from the classical, atom decomposable…

This paper investigates fractional torsional rigidity on compact, connected metric graphs, a novel extension of the classical concept to nonlocal operators. The fractional torsional rigidity is defined as the $L^1$-norm of the fractional…