Results 1 to 10 of about 174 (114)
Mobius Group Generated by Two Elements of Order 2, 4, and Reduced Quadratic Irrational Numbers
Journal of Function Spaces, Volume 2022, Issue 1, 2022., 2022 The construction of circuits for the evolution of orbits and reduced quadratic irrational numbers under the action of Mobius groups have many applications like in construction of substitution box (s-box), strong-substitution box (s.s-box), image ...
Dilshad Alghazzawi +4 more
core +2 more sources
Al-Farooq Journal of SciencesThis paper offers a unified, research-level treatment of the interaction between graph-theoretic invariants and the normal subgroup structure of graph automorphism groups. Starting from the classical framework of Frucht, Sabidussi, Whitney and Watkins, we develop the analysis of as a permutation group through three complementary lenses: (i) the ...
null AMNNAH ABUOJAYLAH ALHADI RASHEED +1 more
exaly +2 more sources
Determining Number of Kneser Graphs: Exact Values and Improved Bounds [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 The determining number of a graph $G = (V,E)$ is the minimum cardinality of a set $S\subseteq V$ such that pointwise stabilizer of $S$ under the action of $Aut(G)$ is trivial.
Angsuman Das, Hiranya Kishore Dey
doaj +1 more source
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
Finite groups with 4p2q elements of maximal order
Open Mathematics, 2021 It is an interesting and difficult topic to determine the structure of a finite group by the number of elements of maximal order. This topic is related to Thompson’s conjecture, that is, if two finite groups have the same order type and one of them is ...
Tan Sanbiao, Chen Guiyun, Yan Yanxiong
doaj +1 more source
On Semisymmetric Cubic Graphs of Order 20p2, p Prime
Discussiones Mathematicae Graph Theory, 2021 A simple graph is called semisymmetric if it is regular and edge-transitive but not vertex-transitive. Let p be an arbitrary prime. Folkman proved [Regular line-symmetric graphs, J. Combin. Theory 3 (1967) 215–232] that there is no semisymmetric graph of
Shahsavaran Mohsen +1 more
doaj +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
Burnside Chromatic Polynomials of Group-Invariant Graphs
Discussiones Mathematicae Graph Theory, 2023 We introduce the Burnside chromatic polynomial of a graph that is invariant under a group action. This is a generalization of the Q-chromatic function Zaslavsky introduced for gain graphs.
White Jacob A.
doaj +1 more source
Laplacian spectrum of comaximal graph of the ring ℤn
Special 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
Symmetric graphs of valency seven and their basic normal quotient graphs
Open Mathematics, 2021 We characterize seven valent symmetric graphs of order 2pqn2p{q}^{n} with ...
Pan Jiangmin, Huang Junjie, Wang Chao
doaj +1 more source