Results 71 to 80 of about 1,357 (88)
The edge-regular complete maps
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
Let SS be a semigroup. In this study, we first introduce the Green’s digraphs and Green’s graphs related to the Green’s relations L{\mathscr{L}}, R{\mathscr{R}}, and J{\mathscr{J}} of SS.
Cheng Yanliang, Shao Yong, Ma Xuanlong
doaj +1 more source
Small clique number graphs with three trivial critical ideals
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
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
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
Classifying pentavalent symmetric graphs of order 12pq
A 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
Forbidden subgraphs of TI-power graphs of finite groups
Given a finite group GG with identity ee, the TI-power graph (trivial intersection power graph) defined on GG, denoted by Γ(G)\Gamma \left(G), is an undirected graph with vertex set GG where distinct vertices aa and bb are adjacent if ⟨a⟩∩⟨b⟩={e}\langle ...
Li Huani, Chen Jin, Lin Shixun
doaj +1 more source
Solutions to some congruence equations via suborbital graphs. [PDF]
Güler BÖ, Kör T, Şanlı Z.
europepmc +1 more source
THE SHAPE OF THE ONE-DIMENSIONAL PHYLOGENETIC LIKELIHOOD FUNCTION. [PDF]
Dinh V, Matsen FA.
europepmc +1 more source
On the Decomposition of Vertex-Transitive Graphs into Multicycles. [PDF]
Leighton FT.
europepmc +1 more source

