Finite groups whose coprime graph is split, threshold, chordal, or a cograph
Given 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, respectively. This paper classifies the finite group...
Saved in:
Main Authors: | Jin Chen, Shixun Lin, Xuanlong Ma |
---|---|
Format: | Article |
Language: | English |
Published: |
Estonian Academy Publishers
2024-10-01
|
Series: | Proceedings of the Estonian Academy of Sciences |
Subjects: | |
Online Access: | https://kirj.ee/wp-content/plugins/kirj/pub/proc-4-2024-323-331_20241003103848.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Finite groups whose coprime graphs are AT-free
by: Huani Li, et al.
Published: (2024-11-01) -
On forbidden subgraphs of main supergraphs of groups
by: Xiaoyan Xu, et al.
Published: (2024-08-01) -
Apex Graphs and Cographs
by: Jagdeep Singh, et al.
Published: (2024-01-01) -
Forbidden subgraphs of Co-prime graphs of finite groups
by: Swathi V V, et al.
Published: (2024-06-01) -
Threshold Protocol Game on Graphs with Magic Square-Generalization Labelings
by: Alexandra Fedrigo
Published: (2024-12-01)