67
Views
0
CrossRef citations to date
0
Altmetric
Articles

Planar character-graphs

, ORCID Icon &
Pages 4079-4087 | Received 06 Jan 2021, Accepted 29 Mar 2021, Published online: 26 Apr 2021

References

  • Akhlaghi, Z., Casolo, C., Dolfi, S., Khedri, K., Pacifici, E. (2018). On the character degree graph of solvable groups. Proc. Am. Math. Soc. 146(4):1505–1513. DOI: 10.1090/proc/13879.
  • Akhlaghi, Z., Casolo, C., Dolfi, S., Pacifici, E., Sanus, L. (2019). On the character degree graph of finite groups. Ann. Mat. 198(5):1595–1614. DOI: 10.1007/s10231-019-00833-0.
  • Akhlaghi, Z., Dolfi, S., Pacifici, E., Sanus, L. (2020). Bounding the number of vertices in the degree graph of a finite group. J. Pure Appl. Algebra 224(2):725–731. DOI: 10.1016/j.jpaa.2019.06.006.
  • Akhlaghi, Z., Khedri, K., Taeri, B. (2019). Finite groups with K5-free prime graphs. Commun. Algebra 47(7):2577–2603. DOI: 10.1080/00927872.2018.1501576.
  • Akhlaghi, Z., Tong-Viet, H. P. (2015). Finite groups with K4-free prime graphs. Algebr. Represent. Theor. 18(1):235–256. DOI: 10.1007/s10468-014-9491-x.
  • Bondy, J. A., Murty, U. S. R. (2008). Graph Theory (Graduate Texts in Mathematics), Vol. 244. New York, NY: Springer.
  • Ebrahimi, M. (2020). K4-free character graphs with seven vertices. Commun. Algebra 48(3):1001–1010. DOI: 10.1080/00927872.2019.1670197.
  • Ebrahimi, M., Khatami, M., Mirzaei, Z. (2019). 1-connected character-graphs of finite groups with non-bipartite complement. J. Algebra Appl. DOI: 10.1142/S0219498821500584.
  • Hafezieh, R. (2017). Bipartite divisor graph for the set of irreducible character degrees. Int. J. Group Theory 6(4):41–51. DOI: 10.15672/HJMS.2018.594.
  • Herzog, M. (1968). On finite simple groups of order divisible by three primes only. J. Algebra 10(3):383–388. DOI: 10.1016/0021-8693(68)90088-4.
  • Huppert, B., Lempken, W. (2000). Simple groups of order divisible by at most four primes. In Proceedings of the F. Scorina Gomel State University 16, p. 64–75.
  • Isaacs, I. M. (1976). Character Theory of Finite Groups. San Diego, CA: Academic Press.
  • Lewis, M. L. (2001). Solvable groups whose degree graphs have two connected components. J. Group Theory 4(3):255–275.
  • Lewis, M. L. (2008). An overview of graphs associated with character degrees and conjugacy class sizes in finite groups. Rocky Mountain J. Math. 38(1):175–211. DOI: 10.1216/RMJ-2008-38-1-175.
  • Lewis, M. L., White, D. (2003). Connectedness of degree graphs of nonsolvable groups. J. Algebra 266(1):51–76. DOI: 10.1016/S0021-8693(03)00346-6.
  • Lewis, M. L., White, D. (2011). Nonsolvable groups with no prime dividing three character degrees. J. Algebra 336(1):158–183. DOI: 10.1016/j.jalgebra.2011.03.028.
  • Manz, O., Staszewski, R., Willems, W. (1988). On the number of components of a graph related to character degrees. Proc. Am. Math. Soc. 103(1):31–37. DOI: 10.1090/S0002-9939-1988-0938639-1.
  • Tong-Viet, H. P. (2013). Groups whose prime graphs have no triangles. J. Algebra 378:196–206. DOI: 10.1016/j.jalgebra.2012.12.024.
  • Western, A. E. (1899). On groups of order p3q. Proc. London Math. Soc. 30:209–263.
  • White, D. L. (2006). Degree graphs of simple linear and unitary groups. Commun. Algebra 34(8):2907–2921. DOI: 10.1080/00927870600639419.
  • White, D. L. (2013). Character degrees of extensions of PSL2(q) and SL2(q). J. Group Theory 16(1):1–33.
  • Zsigmondy, K. (1892). Zur theorie der potenzreste. Monatsh. Math. Phys. 3(1):265–284. DOI: 10.1007/BF01692444.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.