Results 11 to 20 of about 53 (48)
Hypermaps Over Non-Abelian Simple Groups and Strongly Symmetric Generating Sets [PDF]
, 2023 A generating pair x, y for a group G is said to be symmetric if there exists an automorphism φx,y of G inverting both x and y, that is, xφx,y = x−1 and yφx,y = y−1.
Spiga P., Lucchini A.
core +1 more source
Even circuits in oriented matroids [PDF]
, 2022 In this paper we generalise the even directed cycle problem, which asks whether a given digraph contains a directed cycle of even length, to orientations of regular matroids.
Heuer, Karl +2 more
core +1 more source
, 2021 In this paper we define a way to get a bounded invertible automaton starting from a finite graph. It turns out that the corresponding automaton group is regular weakly branch over its commutator subgroup, contains a free semigroup on two elements and is ...
Donno A. +3 more
core +1 more source
A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of thresholds graphs [PDF]
, 2017 International audience2010 Mathematics Subject Classification: 05C62, 05C75, 05C70, 05C65 ...
Werner, Frank +2 more
core +1 more source
On the planarity of line Mycielskian graph of a graph [PDF]
, 2020 The line Mycielskian graph of a graph G, denoted by Lμ(G) is defined as the graph obtained from L(G) by adding q+1 new vertices E' = ei' : 1 ≤ i ≤ q and e, then for 1 ≤ i ≤ q , joining ei' to the neighbours of ei and to e.
Deshpande, Anuradha V +1 more
core +1 more source
Commuting involution graphs for [(A)\tilde]n [PDF]
, 2006 In this article we consider the commuting graphs of involution conjugacy classes in the affine Weyl group A~n. We show that where the graph is connected the diameter is at most 6.
Hart, Sarah, Hart, Sarah B.
core +1 more source
, 2023 For any finite group, the non-coprime graph of the group is a graph with vertices consisting of all non-identity elements of the group. Two different vertices are considered adjacent if their orders are not coprime, meaning their greatest common divisor (
Wahyu Ulyafandhie Misuki +5 more
core +1 more source
, 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
The Binding Number of a Zero Divisor Graph [PDF]
, 2013 In this paper, we evaluate b(Γ(Z n )). Our main result is, we give maximum value of b(Γ(Z n )) is 0.99999999796427626489236243072661, where n is any positive integer upto fiftieth million.
J Ravi Sankar +3 more
core
Ismorphic Lollipop Graphs are Cospectral with Respect to the Adjacency [PDF]
, 2008 The lollipop graph,denoted by L n,p ,is obtained by appending a complete graph K p to a pendant vertex of a path P n−p .On the basis of discussing the eigenvalues of the lollipop graph,we will show that no two non-isomorphic lollipop graph are cospectral
Hong-Qin Bian, Qin Li, Jing Liu
core