Chromatic Polynomials of Some Mixed Hypergraphs

ECSU Author/Contributor (non-ECSU co-authors, if there are any, appear on document)
Julian A. D. Allagan , Associate Professor (Creator)
Institution
Elizabeth City State University (ECSU )
Web Site: https://www.ecsu.edu/academics/library/index.html

Abstract: Motivated by a recent result of M. Walter [Electron. J. Comb. 16, No. 1, Research Paper R94, 16 p. (2009; Zbl 1186.05059)] concerning the chromatic polynomials of some hypergraphs, we present the chromatic polynomials of several (non-uniform) mixed hypergraphs. We use a recursive process for generating explicit formulae for linear mixed hypercacti and multi-bridge mixed hypergraphs using a decomposition of the underlying hypergraph into blocks, defined via chains. Further, using an algebra software package such as Maple, one can use the basic formulae and process demonstrated in this paper to generate the chromatic polynomials for any linear mixed hypercycle, unicyclic mixed hypercyle, mixed hypercactus and multi-bridge mixed hypergraph. We also give the chromatic polynomials of several examples in illustration of the process including the formulae for some mixed sunflowers.

Additional Information

Publication
Language: English
Date: 2014

Email this document to