Abstract
We construct a family of finite 2-groups which have commuting graph of increasing diameter.
| Original language | English |
|---|---|
| Pages (from-to) | 1600-1603 |
| Number of pages | 4 |
| Journal | Journal of Combinatorial Theory. Series A |
| Volume | 120 |
| Issue number | 7 |
| DOIs | |
| Publication status | Published - 1 Sept 2013 |
Keywords
- Commuting graph
- Diameter
- Special p-group
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
Fingerprint
Dive into the research topics of 'There is no upper bound for the diameter of the commuting graph of a finite group'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver