Results 21 to 30 of about 167 (114)

A new monoid construction under crossed products proceedings of the international congress in honour of professor Hari M. Srivastava [PDF]

open access: yes, 2013
In this paper we define a new monoid construction under crossed products for given monoids. We also present a generating set and a relator set for this product. Finally, we give the necessary and sufficient conditions for the regularity of it. MSC: 05C10,
Cangül, İ. N.   +3 more
core   +1 more source

Laplacian spectrum of comaximal graph of the ring ℤn

open access: yesSpecial Matrices, 2022
In this paper, we study the interplay between the structural and spectral properties of the comaximal graph Γ(Zn)\Gamma \left({{\mathbb{Z}}}_{n}) of the ring Zn{{\mathbb{Z}}}_{n} for n>2n\gt 2.
Banerjee Subarsha
doaj   +1 more source

Pentavalent arc-transitive Cayley graphs on Frobenius groups with soluble vertex stabilizer

open access: yesOpen Mathematics, 2019
A Cayley graph Γ is said to be arc-transitive if its full automorphism group AutΓ is transitive on the arc set of Γ. In this paper we give a characterization of pentavalent arc-transitive Cayley graphs on a class of Frobenius groups with soluble vertex ...
Liu Hailin
doaj   +1 more source

Symmetric graphs of valency seven and their basic normal quotient graphs

open access: yesOpen Mathematics, 2021
We characterize seven valent symmetric graphs of order 2pqn2p{q}^{n} with ...
Pan Jiangmin, Huang Junjie, Wang Chao
doaj   +1 more source

Injectivity results for coarse homology theories

open access: yesProceedings of the London Mathematical Society, Volume 121, Issue 6, Page 1619-1684, December 2020., 2020
Abstract We show injectivity results for assembly maps using equivariant coarse homology theories with transfers. Our method is based on the descent principle and applies to a large class of linear groups or, more generally, groups with finite decomposition complexity.
Ulrich Bunke   +3 more
wiley   +1 more source

2-closures of primitive permutation groups of holomorph type

open access: yesOpen Mathematics, 2019
The 2-closure G(2) of a permutation group G on a finite set Ω is the largest subgroup of Sym(Ω) which has the same orbits as G in the induced action on Ω × Ω.
Yu Xue, Pan Jiangmin
doaj   +1 more source

On the Non-Inverse Graph of a Group

open access: yesDiscussiones Mathematicae - General Algebra and Applications, 2022
Let (G, *) be a finite group and S = {u ∈ G|u ≠ u−1}, then the inverse graph is defined as a graph whose vertices coincide with G such that two distinct vertices u and v are adjacent if and only if either u * v ∈ S or v * u ∈ S.
Amreen Javeria, Naduvath Sudev
doaj   +1 more source

Homotopy type of the complex of free factors of a free group

open access: yesProceedings of the London Mathematical Society, Volume 121, Issue 6, Page 1737-1765, December 2020., 2020
Abstract We show that the complex of free factors of a free group of rank n⩾2 is homotopy equivalent to a wedge of spheres of dimension n−2. We also prove that for n⩾2, the complement of (unreduced) Outer space in the free splitting complex is homotopy equivalent to the complex of free factor systems and moreover is (n−2)‐connected.
Benjamin Brück, Radhika Gupta
wiley   +1 more source

Finite groups with star-free noncyclic graphs

open access: yesOpen Mathematics, 2019
For a finite noncyclic group G, let Cyc(G) be the set of elements a of G such that 〈a, b〉 is cyclic for each b of G. The noncyclic graph of G is a graph with the vertex set G ∖ Cyc(G), having an edge between two distinct vertices x and y if 〈x, y〉 is not
Ma Xuanlong, Walls Gary L., Wang Kaishun
doaj   +1 more source

End-regular and End-orthodox generalized lexicographic products of bipartite graphs

open access: yesOpen Mathematics, 2016
A graph X is said to be End-regular (End-orthodox) if its endomorphism monoid End(X) is a regular (orthodox) semigroup. In this paper, we determine the End-regular and the End-orthodox generalized lexicographic products of bipartite graphs.
Gu Rui, Hou Hailong
doaj   +1 more source

Home - About - Disclaimer - Privacy