Block Circulant Graphs and the Graphs of Critical Pairs of a Crown
Preprint
Abstract
In this paper, we provide a natural bijection between a special family of block circulant graphs and the graphs of critical pairs of the posets known as generalized crowns. In particular, every graph in this family of block circulant graphs we investigate has a generating block row that follows a symmetric growth pattern of the all ones matrix. The natural bijection provides an upper bound on the chromatic number for this infinite family of graphs.Keywords
All Related Versions
This publication has 3 references indexed in Scilit:
- Dimension, Graph and Hypergraph ColoringOrder, 2000
- Hardness results and spectral techniques for combinatorial problems on circulant graphsLinear Algebra and its Applications, 1998
- On a Matrix Algebra Related to the Discrete Hartley TransformSIAM Journal on Matrix Analysis and Applications, 1993