Results 11 to 20 of about 122 (75)
Quasi‐isometric diversity of marked groups
Abstract We use basic tools of descriptive set theory to prove that a closed set S of marked groups has 2ℵ0 quasi‐isometry classes, provided that every non‐empty open subset of S contains at least two non‐quasi‐isometric groups. It follows that every perfect set of marked groups having a dense subset of finitely presented groups contains 2ℵ0 quasi ...
A. Minasyan, D. Osin, S. Witzel
wiley +1 more source
Congruences and Hoehnke Radicals on Graphs
We motivate, introduce, and study radicals on classes of graphs. This concept, and the theory which is developed, imitates the original notion of a Hoehnke radical in universal algebra using congruences.
Broere Izak +2 more
doaj +1 more source
The structure fault tolerance of burnt pancake networks
One of the symbolic parameters to measure the fault tolerance of a network is its connectivity. The HH-structure connectivity and HH-substructure connectivity extend the classical connectivity and are more practical.
Ge Huifen, Ye Chengfu, Zhang Shumin
doaj +1 more source
Calculating the virtual cohomological dimension of the automorphism group of a RAAG
Abstract We describe an algorithm to find the virtual cohomological dimension of the automorphism group of a right‐angled Artin group. The algorithm works in the relative setting; in particular, it also applies to untwisted automorphism groups and basis‐conjugating automorphism groups.
Matthew B. Day +2 more
wiley +1 more source
On cospectrality of gain graphs
We define GG-cospectrality of two GG-gain graphs (Γ,ψ)\left(\Gamma ,\psi ) and (Γ′,ψ′)\left(\Gamma ^{\prime} ,\psi ^{\prime} ), proving that it is a switching isomorphism invariant.
Cavaleri Matteo, Donno Alfredo
doaj +1 more source
A Cayley graph Γ\Gamma on a group G is called a dual Cayley graph on G if the left regular representation of G is a subgroup of the automorphism group of Γ\Gamma (note that the right regular representation of G is always an automorphism group of Γ ...
Pan Jiangmin
doaj +1 more source
Path homology theory of edge-colored graphs
In this paper, we introduce the category and the homotopy category of edge-colored digraphs and construct the functorial homology theory on the foundation of the path homology theory provided by Grigoryan, Muranov, and Shing-Tung Yau.
Muranov Yuri V., Szczepkowska Anna
doaj +1 more source
Distinguishing Cartesian Products of Countable Graphs
The distinguishing number D(G) of a graph G is the minimum number of colors needed to color the vertices of G such that the coloring is preserved only by the trivial automorphism.
Estaji Ehsan +4 more
doaj +1 more source
Finite groups whose intersection power graphs are toroidal and projective-planar
The intersection power graph of a finite group GG is the graph whose vertex set is GG, and two distinct vertices xx and yy are adjacent if either one of xx and yy is the identity element of GG, or ⟨x⟩∩⟨y⟩\langle x\rangle \cap \langle y\rangle is non ...
Li Huani, Ma Xuanlong, Fu Ruiqin
doaj +1 more source
Finite groups with 4p2q elements of maximal order
It is an interesting and difficult topic to determine the structure of a finite group by the number of elements of maximal order. This topic is related to Thompson’s conjecture, that is, if two finite groups have the same order type and one of them is ...
Tan Sanbiao, Chen Guiyun, Yan Yanxiong
doaj +1 more source

