Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
On central digraphs constructed from left loops and loops
Authors: R. Rawat
– 0.39 Mb
Abstract
Let An be the set of n X n zero-one matrices satisfying the matrix equation A2 = Jn; where Jn is n X n matrices of all ones. In this article, it is proved that the number of non-isomorphic left loops of order k gives the lower bound to the size of An for n = k2. Mainly we have established that any matrix in An corresponding to loop has rank 2k - 2, where n = k2, for some positive integer k.Department of Mathematics
Central University of South Bihar
Gaya - 824236
Bihar, India
E-mail: ,
Central University of South Bihar
Gaya - 824236
Bihar, India
E-mail: ,
DOI
https://doi.org/10.56415/qrs.v31.09Fulltext
– 0.39 Mb
Contents
- On the intersection ideal graph of semigroups
- On topological completely inverse AG**-groupoids
- A double construction of quadratic anticenter-symmetric Jacobi-Jordan algebras
- On the universality and isotopy-isomorphy of (r,s,t)-inverse quasigroups and loops with applications to cryptography
- Semigroups in which the radical of every interior ideal is a subsemigroup
- Branched covers induced by semisymmetric quasigroup homomorphisms
- General form of the automorphism group of bicyclic graphs
- Weakly quasi invo-clean rings
- On central digraphs constructed from left loops and loops
- Some types of interior filters in quasi-ordered semigroups
- Injective and projective poset acts
