Results 71 to 80 of about 174 (114)
Commuting graphs of gamma rings
Open MathematicsLet M be a non-commutative gamma ring and ZΓM ${Z}_{{\Gamma}}\left(M\right)$ denote the center of the gamma ring M. The vertices a and b are consecutive if a ≠ b and aαb = bαa for every α ∈ Γ, with vertices taken from the set M−ZΓM $M-{Z}_{{\Gamma ...
Arslan Okan
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
A more detailed classification of symmetric cubic graphs
, 2008 A graph Γ is symmetric if its automorphism group acts transitively on the arcs of Γ, and s-regular if its automorphism group acts regularly on the set of s-arcs of Γ.
Marston Conder, Roman Nedela
core
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
The Armendariz Graph of a Ring
Discussiones Mathematicae - General Algebra and Applications, 2018 In this paper we initiate the study of Armendariz graph of a commutative ring R and investigate the basic properties of this graph such as diameter, girth, domination number, etc.
Abdioğlu Cihat +2 more
doaj +1 more source
Recognizing Circulant Graphs of Prime Order in Polynomial Time
, 1998 A circulant graph G of order n is a Cayley graph over the cyclic group Z n : Equivalently, G is circulant iff its vertices can be ordered such that the corresponding adjacency matrix becomes a circulant matrix. To each circulant graph we may associate a
Mikhail E. Muzychuk, Gottfried Tinhofer
core
On 3-regular and 4-regular Cayley Graphs of Abelian Groups
, 2007 In this paper we find all 3-regular and 4-regular Cayley graphs of abelian groups. Their diameters are almost found. We also give another prove for a well-known theorem that G is 2-DCI if and only if G is 4-CI.
Wai-Chee Shiu
core
Automorphisms and independent number of single nonzero component graph over a vector space
Open MathematicsIn this paper, we introduce a graph structure, called the single non-zero component graph Γ(V) ${\Gamma}\left(\mathbb{V}\right)$ , on a finite dimensional vector space V $\mathbb{V}$ .
Xi Wentao +3 more
doaj +1 more source
On the number of edges of a simple Z 2 × Z 2-connected graph
Open MathematicsLuo, Xu and Yu proposed an extremal problem on group connectivity of graphs as follows: for an abelian group A with |A| ≥ 3 and an integer n ≥ 3, find ex(n, A), where ex(n, A) is the maximum number such that every simple graph with n vertices and at most
Zhang Yue, Yin Jian-Hua
doaj +1 more source