Related papers: Classification of Graph Fractaloids
The domatic number of a graph is the maximum number of vertex disjoint dominating sets that partition the vertex set of the graph. In this paper we consider the fractional variant of this notion. Graphs with fractional domatic number 1 are…
A graph G is distinguished if its vertices are labelled by a map \phi: V(G) \longrightarrow {1,2,...,k} so that no graph automorphism preserves \phi. The distinguishing number of G is the minimum number k necessary for \phi to distinguish…
We introduce a new subclass of chordal graphs that generalizes split graphs, which we call well-partitioned chordal graphs. Split graphs are graphs that admit a partition of the vertex set into cliques that can be arranged in a star…
A graph is unipolar if it can be partitioned into a clique and a disjoint union of cliques, and a graph is a generalised split graph if it or its complement is unipolar. A unipolar partition of a graph can be used to find efficiently the…
In this paper, we consider certain elements in von Neumann algebras generated by graph groupoids. In particular, we are interested in finitely supported elements, called graph operators. We study the characterizations for self-adjointness,…
In the present article, the main attention is given to fractal sets whose elements have certain restrictions on using digits or combinations of digits in own nega-P-representation. Topological, metric, and fractal properties of images of…
A fractal function is a function whose graph is the attractor of an iterated function system. This paper generalizes analytic continuation of an analytic function to continuation of a fractal function.
This paper deals with the classification of groups $G$ such that power graphs and proper power graphs of $G$ are line graphs. In fact, we classify all finite nilpotent groups whose power graphs are line graphs. Also, we categorize all…
A fractional matching of a graph $G$ is a function $f:E(G) \to [0,1]$ such that for any $v\in V(G)$, $\sum_{e\in E_G(v)}f(e)\leq 1$ where $E_G(v) = \{e \in E(G): e$ is incident with $v$ in $G\}$. The fractional matching number of $G$ is…
A {\it fractional matching} of a graph $G$ is a function $f$ giving each edge a number in $[0,1]$ so that $\sum_{e \in \Gamma(v)} f(e) \le 1$ for each $v\in V(G)$, where $\Gamma(v)$ is the set of edges incident to $v$. The {\it fractional…
We define a new mathematical structure ( graph quantum group) which combines the tower of algebras associated with a graph ${\cal G}$ and the structure of a Hopf algebra {\cal A}. In this structure Ocneanu's string operators become Hopf…
We introduce fractional flat space, described by a continuous geometry with constant non-integer Hausdorff and spectral dimensions. This is the analogue of Euclidean space, but with anomalous scaling and diffusion properties. The basic tool…
Graph classification plays an important role is data mining, and various methods have been developed recently for classifying graphs. In this paper, we propose a novel method for graph classification that is based on homotopy equivalence of…
Consider pairs of the form (G, N), with G a group and N \normal G, as objects of a category \PG. A morphism (G_1, N_1) \To (G_2, N_2) will be a group homomorphism f : G_1 \To G_2 such that f(N_1) \subset N_2. We introduce a functor Q : \PG…
A fractional matching of $G$ is a function $f: E(G)\to [0,1]$ such that $\sum_{e\in E_G(v_i)}f(e)\le 1$ for any $v_i\in V(G)$, where $E_G(v_i)=\{e: e\in E(G) \ \textrm{and}\ e \ \textrm{is incident with} \ v_i\}$. Let $\alpha_f(G)$ denote…
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…
A split graph is a graph whose vertex set can be partitioned into a clique and an independent set. The word-representability of split graphs was studied in a series of papers in the literature, and the class of word-representable split…
We introduce the fractal expansions, sequences of integers associated to a number. We show that these sequences characterize the O-sequences and encode some information on lex segment ideals. Moreover, we introduce a numerical functions…
In this paper, we use the theory of Riordan matrices to introduce the notion of an oriented Riordan graph. The oriented Riordan graphs are a far-reaching generalization of the well known and well studied Toeplitz oriented graphs and…
We describe proper actors from the underlying groupoid of a graph C*-algebra to another \'etale groupoid in terms of bisections. This allows to understand graph morphisms and the *-homomorphisms that they induce more conceptually. More…