Results 61 to 70 of about 1,383 (108)
Cyclic Partitions of Complete and Almost Complete Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2022 We consider cyclic partitions of the complete k-uniform hypergraph on a finite set V, minus a set of s edges, s ≥ 0. An s-almost t-complementary k-hypergraph is a k-uniform hypergraph with vertex set V and edge set E for which there exists a permutation ...
Dilbarjot, Gosselin Shonda Dueck
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
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
Classification of Filiform Lie Algebras up to dimension 7 Over Finite Fields
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016 This paper tries to develop a recent research which consists in using Discrete Mathematics as a tool in the study of the problem of the classification of Lie algebras in general, dealing in this case with filiform Lie algebras up to dimension 7 over ...
Falcón Óscar J. +4 more
doaj +1 more source
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
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
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