Related papers: Classification of Graph Fractaloids
A graph is split if there is a partition of its vertex set into a clique and an independent set. The present paper is devoted to the splitness of some graphs related to finite simple groups, namely, prime graphs and solvable graphs, and…
The permutation associated with the decimal expression of the binary reflected Gray code with $N$ bits is considered. Its cycle structure is studied. Considered as a set of points, its self-similarity is pointed out. As a fractal, it is…
Let $\mathbb{G}_{n,\gamma}$ be the set of simple and connected graphs on $n$ vertices and with domination number $\gamma$. The graph with minimum spectral radius among $\mathbb{G}_{n,\gamma}$ is called the minimizer graph. In this paper, we…
A fractional $(a,b,m)$-covered graph is a generalization of the concept of a fractional $[a,b]$-covered graph. For any $H \subseteq G$ with edge set $|E(H)| = m$, if there exists a fractional $[a,b]$-factor (the corresponding fractional…
The Divisibility Graph of a finite group $G$ has vertex set the set of conjugacy class lengths of non-central elements in $G$ and two vertices are connected by an edge if one divides the other. We determine the connected components of the…
There are many research papers dealing with fractal dimension of real-valued fractal functions in the recent literature. The main focus of the present paper is to study fractal dimension of complex-valued functions. This paper also…
Fractional graph isomorphism is the linear relaxation of an integer programming formulation of graph isomorphism. It preserves some invariants of graphs, like degree sequences and equitable partitions, but it does not preserve others like…
Graph signal processing (GSP) leverages the inherent signal structure within graphs to extract high-dimensional data without relying on translation invariance. It has emerged as a crucial tool across multiple fields, including learning and…
A $\lambda$-graph system $\frak L$ is a labeled Bratteli diagram with shift operation. It is a generalized notion of finite labeled graph and presents a subshifts. We will study continuous orbit equivalence of one-sided subshifts and…
The splitting number is effective to distinguish the embedded topology of plane curves, and it is not determined by the fundamental group of the complement of the plane curve. In this paper, we give a generalization of the splitting number,…
Let $G$ be a group. The intersection subgroup graph of $G$ (introduced by Anderson et al. \cite{anderson}) is the simple graph $\Gamma_{S}(G)$ whose vertices are those non-trivial subgroups say $H$ of $G$ with $H\cap K=\{e\}$ for some…
In \cite{LaLuRa13}, the authors completely classified the topological structure of so called {\it fractal square} $F$ defined by $F=(F+{\mathcal D})/n$, where ${\mathcal{D}}\subsetneq\{0,1,\dots,n-1\}^2, n\ge 2$. In this paper, we further…
The associative spectrum of a groupoid (i.e., a set with a binary operation) measures its nonassociativity while the associative-commutative spectrum measures both nonassociativity and noncommutativity of the groupoid. The two spectra are…
A travel groupoid is an algebraic system satisfying two suitable conditions, which has a relation to graphs. In this article, we characterize travel groupoids on finite complete multipartite graphs, and we give the numbers of travel…
This paper is a survey, with few proofs, of ideas and notions related to self-similarity of groups, semi-groups and their actions. It attempts to relate these concepts to more familiar ones, such as fractals, self-similar sets, and…
A unitary shift operator (GSO) for signals on a graph is introduced, which exhibits the desired property of energy preservation over both backward and forward graph shifts. For rigour, the graph differential operator is also derived in an…
The 2-switch-degree of $G$ is the number of distinct 2-switches acting on a graph $G$. In this work we study structural properties of the 2-switch-degree, with a focus on split graphs. Our approach is motivated by the Tyshkevich…
In this paper, we introduce the concept of the $\alpha$-fractal function and fractal approximation for a set-valued continuous map defined on a closed and bounded interval of real numbers. Also, we study some properties of such fractal…
Block graphs are graphs in which every block (biconnected component) is a clique. A graph $G=(V,E)$ is said to be an (unpartitioned) $k$-probe block graph if there exist $k$ independent sets $N_i\subseteq V$, $1\le i\le k$, such that the…
In this paper we deal with a subclass of chordal graphs, which are simultaneously strictly chordal and interval, the strictly interval graphs. We present a new characterization of the class that leads to a simple linear recognition…