On the diameter of a super-order-commuting graph
Combinatorics
2024-01-26 v1
Abstract
We answer a question about the diameter of an order-super-commuting graph on a symmetric group by studying the number-theoretical concept of -complete sequences of primes in arithmetic progression.
Cite
@article{arxiv.2401.14335,
title = {On the diameter of a super-order-commuting graph},
author = {Janko Bračič and Bojan Kuzma},
journal= {arXiv preprint arXiv:2401.14335},
year = {2024}
}