Results 1 to 10 of about 113,297 (70)
The clique number of the intersection graph of a cyclic group of order with at most three prime factors [PDF]
ریاضی و جامعه, 2023 Let $G$ be a finite non-trivial group. The intersection graph $\Gamma(G)$, is a graph whose vertices are all proper non-trivial subgroups of $G$, and there is an edge between two distinct vertices $H $ and $K$ if and only if $H\cap K\neq 1$.
Seyyed Majid Jafarian Amiri +1 more
doaj +1 more source
ON SOME VERTEX-TRANSITIVE DISTANCE-REGULAR ANTIPODAL COVERS OF COMPLETE GRAPHS
Ural Mathematical Journal, 2022 In the present paper, we classify abelian antipodal distance-regular graphs \(\Gamma\) of diameter 3 with the following property: \((*)\) \(\Gamma\) has a transitive group of automorphisms \(\widetilde{G}\) that induces a primitive almost simple ...
Ludmila Yu. Tsiovkina
doaj +1 more source
A 2-arc Transitive Hexavalent Nonnormal Cayley Graph on A119
Mathematics, 2021 A Cayley graph Γ=Cay(G,S) is said to be normal if the base group G is normal in AutΓ. The concept of the normality of Cayley graphs was first proposed by M.Y.
Bo Ling, Wanting Li, Bengong Lou
doaj +1 more source
Top-Down Construction of Independent Spanning Trees in Alternating Group Networks
IEEE Access, 2020 A set of spanning trees in a graph G is called independent spanning trees (ISTs) if they are rooted at the same vertex r, and for each vertex v(≠ r) in G, the two paths from v to r in any two trees share no common vertex expect for v and r.
Jie-Fu Huang +3 more
doaj +1 more source
Measurable versions of Vizing's theorem [PDF]
, 2020 We establish two versions of Vizing's theorem for Borel multi-graphs whose vertex degrees and edge multiplicities are uniformly bounded by respectively $\Delta$ and $\pi$.
Grebík, Jan, Pikhurko, Oleg
core +2 more sources
Minimum Neighborhood of Alternating Group Graphs
IEEE Access, 2019 The minimum neighborhood and combinatorial property are two important indicators of fault tolerance of a multiprocessor system. Given a graph G, θG(q) is the minimum number of vertices adjacent to a set of q vertices of G (1 ≤ q ≤ |V(
Yanze Huang +3 more
doaj +1 more source
IEEE Access, 2019 For an integer ℓ ≥ 2, the ℓ-component connectivity of a graph G, denoted by κℓ(G), is the minimum number of vertices whose removal from G results in a disconnected graph with at least ℓ components or a graph with
Mei-Mei Gu, Rong-Xia Hao, Jou-Ming Chang
doaj +1 more source
Finite groups whose coprime graph is split, threshold, chordal, or a cograph [PDF]
Proceedings of the Estonian Academy of SciencesGiven a finite group G, the coprime graph of G, denoted by Î(G), is defined as an undirected graph with the vertex set G, and for distinct x, y â G, x is adjacent to y if and only if (o(x), o(y)) = 1, where o(x) and o(y) are the orders of x and y ...
Jin Chen, Shixun Lin, Xuanlong Ma
doaj +1 more source
Schur Algebras for the Alternating Group and Koszul Duality
, 2020 We introduce the alternating Schur algebra $AS_F(n,d)$ as the commutant of the action of the alternating group $A_d$ on the $d$-fold tensor power of an $n$-dimensional $F$-vector space.
Geetha, Thangavelu +2 more
core +1 more source
Product mixing in the alternating group
Discrete Analysis, 2016 Product mixing in the alternating group, Discrete Analysis 2016:2, 18 pp. Growth and mixing of subsets of groups is a major theme in group theory. The former concerns lower bounds for the sizes of product sets, especially of the form $A^k$, where $A$ is
Sean Eberhard
doaj +1 more source