{
  "id": "2008.11587",
  "version": "v1",
  "published": "2020-08-26T14:44:40.000Z",
  "updated": "2020-08-26T14:44:40.000Z",
  "title": "On prime character degree graphs occurring within a family of graphs",
  "authors": [
    "Jacob Laubacher",
    "Mark Medwid"
  ],
  "comment": "15 pages, 6 figures, comments welcome",
  "categories": [
    "math.GR"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2020-08-26T14:44:40.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "20D10",
      "20C15",
      "05C75"
    ],
    "keywords": [
      "prime character degree graphs occurring",
      "complete graphs",
      "odd cycle",
      "connected graphs"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 15,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}