Results 71 to 80 of about 167 (114)
The join of split graphs whose completely regular endomorphisms form a monoid
Open Mathematics, 2017 In this paper, completely regular endomorphisms of the join of split graphs are investigated. We give conditions under which all completely regular endomorphisms of the join of two split graphs form a monoid.
Hou Hailong, Song Yanhua, Gu Rui
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
Determination Of All Regular Maps Of Small Genus [PDF]
Complete lists are given of all reflexible orientable regular maps of genus 2 to 15, all non-orientable regular maps of genus 4 to 30, and all (orientable) rotary but chiral (irreflexible) maps of genus 2 to 15 inclusive.
Marston Conder, Peter Dobesányi
core
Simplicial complexes defined on groups
Open MathematicsThis study makes some preliminary observations towards an extension of current work on graphs defined on groups to simplicial complexes. I define a variety of simplicial complexes on a group, which are preserved by automorphisms of the group, and in many
Cameron Peter J.
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
Note on the product of the largest and the smallest eigenvalue of a graph
Special MatricesIn this note, we use eigenvalue interlacing to derive an inequality between a graph’s maximum degree and its maximum and minimum adjacency eigenvalues. The equality case is fully characterized.
Abiad Aida +2 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
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 pentavalent symmetric graphs of order 12pq
Open MathematicsA graph is said to be symmetric if its automorphism group is transitive on its arcs. Guo et al. (Pentavalent symmetric graphs of order 12p, Electron. J. Combin. 18 (2011), no. 1, #P233, DOI: https://doi.org/10.37236/720) and Ling (Classifying pentavalent
Qian Xiaorui +3 more
doaj +1 more source