Results 21 to 30 of about 174 (114)
On Perfectness of Intersection Graph of Ideals of ℤn
In this short paper, we characterize the positive integers n for which intersection graph of ideals of ℤn is perfect.
Das Angsuman
doaj +1 more source
Remark on subgroup intersection graph of finite abelian groups
Let G be a finite group. The subgroup intersection graph Γ(G)\text{Γ}(G) of G is a graph whose vertices are non-identity elements of G and two distinct vertices x and y are adjacent if and only if |〈x〉∩〈y〉|>1|\langle x\rangle \cap \langle y\rangle
Zhao Jinxing, Deng Guixin
doaj +1 more source
The intersection graph of graded submodules of a graded module
In this article, we introduce and study the intersection graph of graded submodules of a graded module. Let MM be a left GG-graded RR-module. We define the intersection graph of GG-graded RR-submodules of MM, denoted by Γ(G,R,M)\Gamma \left(G,R,M), to be
Alraqad Tariq
doaj +1 more source
Generalized Munn rings exist extensively in the theory of rings. The aim of this note is to answer when a generalized Munn ring is primitive (semiprimitive, semiprime and prime, respectively).
Guo Junying, Guo Xiaojiang
doaj +1 more source
Orientable ℤN-Distance Magic Graphs
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
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
Chromatic Properties of the Pancake Graphs
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
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
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
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

