Algebraic invariants arising from the chromatic polynomials of theta graphs
Version 2 2024-06-18, 07:12Version 2 2024-06-18, 07:12
Version 1 2018-04-16, 13:05Version 1 2018-04-16, 13:05
journal contribution
posted on 2014-01-01, 00:00authored byD Delbourgo, Kerri Morgan
This paper investigates some algebraic properties of the chromatic polynomials of theta graphs, i.e. graphs which have three internally disjoint paths sharing the same two distinct end vertices. We give a complete description of the Galois group, discriminant and ramification indices for the chromatic polynomials of theta graphs with three consecutive path lengths. We then do the same for theta graphs with three paths of the same length, by comparing them algebraically to the first family. This algebraic link extends naturally to generalised theta graphs with k + 1 branches.
History
Journal
Australasian journal of combinatorics
Volume
59
Issue
2
Pagination
293 - 310
Publisher
Centre for Combinatorics Dept. of Mathematics, University of Queensland
Location
St. Lucia, Qld.
ISSN
1034-4942
eISSN
2202-3518
Language
eng
Publication classification
C Journal article; C1.1 Refereed article in a scholarly journal
Copyright notice
[2014, Centre for Combinatorics Dept. of Mathematics, University of Queensland]