Classifying character degree graphs with six vertices

Mark W. Bissler; Jacob Laubacher; Mark L. Lewis

doi:10.1007/s13366-019-00437-y

Back

Classifying character degree graphs with six vertices

Journal article

Peer reviewed

Classifying character degree graphs with six vertices

Mark W. Bissler, Jacob Laubacher and Mark L. Lewis

Beiträge zur Algebra und Geometrie, Vol.60(3), pp.499-511

01/09/2019

DOI: https://doi.org/10.1007/s13366-019-00437-y

Abstract

Algebra

Algebraic Geometry

Convex and Discrete Geometry

Geometry

Mathematics

Mathematics and Statistics

Original Paper

We investigate prime character degree graphs of solvable groups that have six vertices. There are 112 non-isomorphic connected graphs with six vertices, of which all except nine are classified in this paper. We also completely classify the disconnected graphs with six vertices.

Metrics

9 Record Views

8 Times Cited - Web of Science

Details

Title: Classifying character degree graphs with six vertices
Creators - without role: Mark W. Bissler - Kent State University
Jacob Laubacher - St. Norbert College
Mark L. Lewis - Kent State University
Publication Details: Beiträge zur Algebra und Geometrie, Vol.60(3), pp.499-511
Publisher: Springer Berlin Heidelberg
Number of pages: 13
Identifiers: 991019688966507081
Language: English
Resource Type: Journal article