Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
Chromatic Polynomials Of Some (m,l) - Hyperwheels
Authors: J. A. Allagan
Keywords: chromatic polynomial, hyperfan, hyperwheel, Stirling numbers.
– 0.14 Mb
Keywords: chromatic polynomial, hyperfan, hyperwheel, Stirling numbers.
Abstract
In this paper, using a standard method of computing the chromatic polynomial of hypergraphs, we introduce a new reduction theorem which allows us to find explicit formulae for the chromatic polynomials of some (complete) non-uniform (m, l)− hyperwheels and non-uniform (m, l)−hyperfans. These hypergraphs, constructed through a “join” graph operation, are some generalizations of the well-known wheel and fan graphs, respectively. Further, we revisit some results concerning these graphs and present their chromatic polynomials in a standard form that involves the Stirling numbers of the second kind.niversity of North Georgia, Watkinsville, GA, United States.
Department of Mathematics
E-mail:
Department of Mathematics
E-mail:
Fulltext
– 0.14 Mb
Contents
- Solving Problems in Various Domains by Hybrid Models of High Performance Computations
- Chromatic Polynomials Of Some (m,l) - Hyperwheels
- A New Full-Newton Step O(n) Infeasible Interior-Point Algorithm for P*(k)-horizontal Linear Complementarity Problems
- Search tree-based approach for the p-median problem using the ant colony optimization algorithm
- Artificial Bee Colony with Different Mutation Schemes: A comparative study
- A Note on Solvable Polynomial Algebras
- Dynamic Object Identification with SOM-based neural networks
- Evaluating the impact of software metrics on defects prediction. Part 2
