Results 21 to 30 of about 176 (112)
Orientable ℤN-Distance Magic Graphs
Discussiones Mathematicae Graph Theory, 2019 Let G = (V, E) be a graph of order n. A distance magic labeling of G is a bijection ℓ: V → {1, 2, . . ., n} for which there exists a positive integer k such that ∑x∈N(v)ℓ(x) = k for all v ∈ V, where N(v) is the open neighborhood of v.
Cichacz Sylwia +2 more
doaj +1 more source
Congruences and Hoehnke Radicals on Graphs
Discussiones Mathematicae Graph Theory, 2020 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
, 2023 For any finite group, the non-coprime graph of the group is a graph with vertices consisting of all non-identity elements of the group. Two different vertices are considered adjacent if their orders are not coprime, meaning their greatest common divisor (
Wahyu Ulyafandhie Misuki +5 more
core +1 more source
Chromatic Properties of the Pancake Graphs
Discussiones Mathematicae Graph Theory, 2017 Chromatic properties of the Pancake graphs Pn, n ⩾ 2, that are Cayley graphs on the symmetric group Symn generated by prefix-reversals are investigated in the paper.
Konstantinova Elena
doaj +1 more source
The structure fault tolerance of burnt pancake networks
Open Mathematics, 2023 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
Perfect codes in power graphs of finite groups
Open Mathematics, 2017 The power graph of a finite group is the graph whose vertex set is the group, two distinct elements being adjacent if one is a power of the other. The enhanced power graph of a finite group is the graph whose vertex set consists of all elements of the ...
Ma Xuanlong +4 more
doaj +1 more source
On cospectrality of gain graphs
Special Matrices, 2022 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
The non-commuting graph of a non-central hypergroup
Open Mathematics, 2019 The aim of this paper is to construct and study the properties of a certain graph associated with a non-central hypergroup, i.e. a hypergroup having non-commutative the associated fundamental group.
Iranmanesh Mahdiyeh +2 more
doaj +1 more source
Open Mathematics, 2020 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
Open Mathematics, 2021 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