Abstract
A necessary and sufficient condition is proven for the connectivity of commuting graphs C (G, X), where G is Sym (n), the symmetric group of degree n, and X is any G-conjugacy class. © 2005 Elsevier Inc. All rights reserved.
Author supplied keywords
Cite
CITATION STYLE
APA
Bundy, D. (2006). The connectivity of commuting graphs. Journal of Combinatorial Theory. Series A, 113(6), 995–1007. https://doi.org/10.1016/j.jcta.2005.09.003
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free