On prime character degree graphs occurring within a family of graphs
Group Theory
2020-08-27 v1
Abstract
In this paper we investigate families of connected graphs which do not contain an odd cycle in their complement. Specifically, we consider graphs formed by two complete graphs connected in a particular way. We determine which of these graphs can or cannot occur as the prime character degree graph of a solvable group. An obvious expansion and generalization can also be considered, of which we make mention.
Keywords
Cite
@article{arxiv.2008.11587,
title = {On prime character degree graphs occurring within a family of graphs},
author = {Jacob Laubacher and Mark Medwid},
journal= {arXiv preprint arXiv:2008.11587},
year = {2020}
}
Comments
15 pages, 6 figures, comments welcome