On Transiso Graphs of Groups of order less than 32

2015/11/14 by Laxmi Kant Mishra, Mishra, Laxmi Kant, Brajesh Kumar Sharma +1
Computer Science · Engineering · Mathematics · #05C25 #20N05 #Coding theory and cryptography #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1511.04520

openalex publication_date 2015/11/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Transiso graph Γ_d(G) is defined in for a finite group G and a divisor d of |G|. In the present paper, we have determined some finite groups G for which the graphs Γ_d(G) are complete for each divisor d of |G|. We have also discussed the completeness of transiso graphs for the groups of order less than 32.

Related

• On Transiso Graph
• On divisibility graph for simple Zassenhaus groups
• Some Properties of Order-Divisor Graphs of Finite Groups
• Which coprime graphs are divisor graphs?
• Commuting graph of a group on a transversal