Results 51 to 60 of about 122 (75)
On the Genus of the Idempotent Graph of a Finite Commutative Ring
Discussiones Mathematicae - General Algebra and Applications, 2021 Let R be a finite commutative ring with identity. The idempotent graph of R is the simple undirected graph I(R) with vertex set, the set of all nontrivial idempotents of R and two distinct vertices x and y are adjacent if and only if xy = 0.
Belsi G. Gold, Kavitha S., Selvakumar K.
doaj +1 more source
Classifying cubic symmetric graphs of order 88p and 88p 2
Open MathematicsFor a simple graph Γ\Gamma , Γ\Gamma is said to be ss-regular, provided that the automorphism group of Γ\Gamma regularly acts on the set consisting of ss-arcs of Γ\Gamma .
Zhai Liangliang
doaj +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
On Order Prime Divisor Graphs of Finite Groups
Discussiones Mathematicae - General Algebra and Applications, 2021 The order prime divisor graph 𝒫𝒟(G) of a finite group G is a simple graph whose vertex set is G and two vertices a, b ∈ G are adjacent if and only if either ab = e or o(ab) is some prime number, where e is the identity element of the group G and o(x ...
Sen Mridul K. +2 more
doaj +1 more source
Extended Annihilating-Ideal Graph of a Commutative Ring
Discussiones Mathematicae - General Algebra and Applications, 2022 Let R be a commutative ring with identity. An ideal I of a ring R is called an annihilating-ideal if there exists a nonzero ideal J of R such that IJ = (0) and we use the notation 𝔸(R) for the set of all annihilating-ideals of R.
Nithya S., Elavarasi G.
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
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
The edge-regular complete maps
Open Mathematics, 2020 A map is called edge-regular if it is edge-transitive but not arc-transitive. In this paper, we show that a complete graph Kn{K}_{n} has an orientable edge-regular embedding if and only if n=pd>3n={p}^{d}\gt 3 with p an odd prime such that pd≡3{p}^{d ...
Yu Xue, Lou Ben Gong
doaj +1 more source
Small clique number graphs with three trivial critical ideals
Special Matrices, 2018 The critical ideals of a graph are the determinantal ideals of the generalized Laplacian matrix associated to a graph. Previously, they have been used in the understanding and characterizing of the graphs with critical group with few invariant factors ...
Alfaro Carlos A., Valencia Carlos E.
doaj +1 more source
A subexponential construction of graph coloring for multiparty computation
Journal of Mathematical Cryptology, 2014 We show the first deterministic construction of an unconditionally secure multiparty computation (MPC) protocol in the passive adversarial model over black-box non-Abelian groups which is both optimal (secure against an adversary who possesses any ...
Asghar Hassan Jameel +3 more
doaj +1 more source