The connectivity of commuting graphs (Q2500613): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcta.2005.09.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2066087336 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Commuting involution graphs for symmetric groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite groups generated by 3-transpositions. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite quotients of the multiplicative group of a finite dimensional division algebra are solvable / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:22, 24 June 2024

scientific article
Language Label Description Also known as
English
The connectivity of commuting graphs
scientific article

    Statements

    The connectivity of commuting graphs (English)
    0 references
    0 references
    17 August 2006
    0 references
    The author determines a necessary and sufficient condition for the connectivity of commuting graphs \(C(G,X)\), where \(G\) is the symmetric group of degree \(n\) and \(X\) is any \(G\)-conjugacy class.
    0 references
    symmetric group
    0 references

    Identifiers