Let
Révisé le :
Accepté le :
Publié le :
DOI : 10.5802/alco.132
Mots-clés : Generating graph, connectivity, nilpotent groups.
@article{ALCO_2020__3_5_1183_0, author = {Harper, Scott and Lucchini, Andrea}, title = {Connectivity of generating graphs of~nilpotent groups}, journal = {Algebraic Combinatorics}, pages = {1183--1195}, publisher = {MathOA foundation}, volume = {3}, number = {5}, year = {2020}, doi = {10.5802/alco.132}, language = {en}, url = {http://www.numdam.org/articles/10.5802/alco.132/} }
TY - JOUR AU - Harper, Scott AU - Lucchini, Andrea TI - Connectivity of generating graphs of nilpotent groups JO - Algebraic Combinatorics PY - 2020 SP - 1183 EP - 1195 VL - 3 IS - 5 PB - MathOA foundation UR - http://www.numdam.org/articles/10.5802/alco.132/ DO - 10.5802/alco.132 LA - en ID - ALCO_2020__3_5_1183_0 ER -
Harper, Scott; Lucchini, Andrea. Connectivity of generating graphs of nilpotent groups. Algebraic Combinatorics, Tome 3 (2020) no. 5, pp. 1183-1195. doi : 10.5802/alco.132. http://www.numdam.org/articles/10.5802/alco.132/
[1] Probabilistic generation of finite simple groups, II, J. Algebra, Volume 320 (2008) no. 2, pp. 443-494 | DOI | MR | Zbl
[2] Hamiltonian cycles in the generating graphs of finite groups, Bull. Lond. Math. Soc., Volume 42 (2010) no. 4, pp. 621-633 | DOI | MR
[3] On the uniform spread of almost simple linear groups, Nagoya Math. J., Volume 209 (2013), pp. 35-109 | DOI | MR | Zbl
[4] Finite groups,
[5] On the uniform domination number of a finite simple group, Trans. Amer. Math. Soc., Volume 372 (2019) no. 1, pp. 545-583 | DOI | MR | Zbl
[6] The generating graph of finite soluble groups, Israel J. Math., Volume 198 (2013) no. 1, pp. 63-74 | DOI | MR | Zbl
[7] Some theorems on abstract graphs, Proc. London Math. Soc. (3), Volume 2 (1952), pp. 69-81 | DOI | MR
[8] Hamiltonicity of the cross product of two Hamiltonian graphs, Discrete Math., Volume 170 (1997) no. 1-3, pp. 253-257 | DOI | MR | Zbl
[9] Probabilistic generation of finite simple groups, J. Algebra, Volume 234 (2000) no. 2, pp. 743-792 | DOI | MR | Zbl
[10] On the uniform spread of almost simple symplectic and orthogonal groups, J. Algebra, Volume 490 (2017), pp. 330-371 | DOI | MR | Zbl
[11] Maximally edge-connected and vertex-connected graphs and digraphs: a survey, Discrete Math., Volume 308 (2008) no. 15, pp. 3265-3296 | DOI | MR | Zbl
[12] Algebra, Graduate Texts in Mathematics, 211, Springer-Verlag, New York, 2002, xvi+914 pages | DOI | MR | Zbl
[13] The diameter of the generating graph of a finite soluble group, J. Algebra, Volume 492 (2017), pp. 28-43 | DOI | MR | Zbl
[14] On finite simple groups and Kneser graphs, J. Algebraic Combin., Volume 30 (2009) no. 4, pp. 549-566 | DOI | MR | Zbl
[15] On the clique number of the generating graph of a finite group, Proc. Amer. Math. Soc., Volume 137 (2009) no. 10, pp. 3207-3217 | DOI | MR | Zbl
[16] Connectivity of Kronecker products with complete multipartite graphs, Discrete Appl. Math., Volume 161 (2013) no. 10-11, pp. 1655-1659 | DOI | MR | Zbl
[17] Congruent Graphs and the Connectivity of Graphs, Amer. J. Math., Volume 54 (1932) no. 1, pp. 150-168 | DOI | MR | Zbl
- Transverse instability of high frequency weakly stable quasilinear boundary value problems, Quarterly of Applied Mathematics, Volume 81 (2023) no. 4, pp. 633-720 | DOI:10.1090/qam/1637 | Zbl:1522.35326
- Forbidden subgraphs in generating graphs of finite groups, Algebraic Combinatorics, Volume 5 (2022) no. 5, pp. 925-946 | DOI:10.5802/alco.229 | Zbl:1512.20073
- Connected components in the invariably generating graph of a finite group, Bulletin of the Australian Mathematical Society, Volume 104 (2021) no. 3, pp. 453-463 | DOI:10.1017/s0004972721000149 | Zbl:1547.20090
- Dispersive stabilization for phase transitions, Pure and Applied Analysis, Volume 3 (2021) no. 4, pp. 765-788 | DOI:10.2140/paa.2021.3.765 | Zbl:1490.35258
- The generating graph of a profinite group, Archiv der Mathematik, Volume 115 (2020) no. 4, p. 359 | DOI:10.1007/s00013-020-01502-y
- The generating graph of a profinite group, arXiv (2020) | DOI:10.48550/arxiv.2002.06384 | arXiv:2002.06384
Cité par 6 documents. Sources : Crossref, NASA ADS, zbMATH