Finite groups whose coprime graphs are AT-free
Assume that $ G $ is a finite group. The coprime graph of $ G $, denoted by $ \Gamma(G) $, is an undirected graph whose vertex set is $ G $ and two distinct vertices $ x $ and $ y $ of $ \Gamma(G) $ are adjacent if and only if $ (o(x), o(y)) = 1 $, where $ o(x) $ and $ o(y) $ are the orders of $ x $...
Saved in:
Main Authors: | Huani Li, Xuanlong Ma |
---|---|
Format: | Article |
Language: | English |
Published: |
AIMS Press
2024-11-01
|
Series: | Electronic Research Archive |
Subjects: | |
Online Access: | https://www.aimspress.com/article/doi/10.3934/era.2024300 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On forbidden subgraphs of main supergraphs of groups
by: Xiaoyan Xu, et al.
Published: (2024-08-01) -
A note on quantum subgroups of free quantum groups
by: Hoshino, Mao, et al.
Published: (2024-11-01) -
Creating Semantic Learner Groups in Distance Education Using the GraphSAGE approach
by: Chetoui Ismail, et al.
Published: (2025-01-01) -
Height measurement method of monostatic metre wave multiple input multiple output radar based on coprime array
by: Hongzhen Wang, et al.
Published: (2022-06-01) -
On the Graph Isomorphism Completeness of Directed and Multidirected Graphs
by: Sebastian Pardo-Guerra, et al.
Published: (2025-01-01)