Crown graph
| Crown graph | |
|---|---|
 Crown graphs with six, eight, and ten vertices | |
| Vertices | 2n |
| Edges | n(n – 1) |
| Radius | [math]\displaystyle{ \left\{\begin{array}{ll}\infty & n \le 2\\ 3 & \text{otherwise}\end{array}\right. }[/math] |
| Diameter | [math]\displaystyle{ \left\{\begin{array}{ll}\infty & n \le 2\\ 3 & \text{otherwise}\end{array}\right. }[/math] |
| Girth | [math]\displaystyle{ \left\{\begin{array}{ll}\infty & n \le 2\\ 6 & n = 3\\ 4 & \text{otherwise}\end{array}\right. }[/math] |
| Chromatic number | [math]\displaystyle{ \left\{\begin{array}{ll}1 & n = 1\\ 2 & \text{otherwise}\end{array}\right. }[/math] |
| Properties | Distance-transitive |
| Notation | [math]\displaystyle{ S_n^0 }[/math] |
| Table of graphs and parameters | |
In graph theory, a branch of mathematics, a crown graph on 2n vertices is an undirected graph with two sets of vertices {u1, u2, …, un} and {v1, v2, …, vn} and with an edge from ui to vj whenever i ≠ j.
The crown graph can be viewed as a complete bipartite graph from which the edges of a perfect matching have been removed, as the bipartite double cover of a complete graph, as the tensor product Kn × K2, as the complement of the Cartesian direct product of Kn and K2, or as a bipartite Kneser graph Hn,1 representing the 1-item and (n – 1)-item subsets of an n-item set, with an edge between two subsets whenever one is contained in the other.
Examples
The 6-vertex crown graph forms a cycle, and the 8-vertex crown graph is isomorphic to the graph of a cube. In the Schläfli double six, a configuration of 12 lines and 30 points in three-dimensional space, the twelve lines intersect each other in the pattern of a 12-vertex crown graph.
Properties
The number of edges in a crown graph is the pronic number n(n – 1). Its achromatic number is n: one can find a complete coloring by choosing each pair {ui, vi} as one of the color classes.[1] Crown graphs are symmetric and distance-transitive. (Archdeacon Debowsky) describe partitions of the edges of a crown graph into equal-length cycles.
The 2n-vertex crown graph may be embedded into four-dimensional Euclidean space in such a way that all of its edges have unit length. However, this embedding may also place some non-adjacent vertices a unit distance apart. An embedding in which edges are at unit distance and non-edges are not at unit distance requires at least n – 2 dimensions. This example shows that a graph may require very different dimensions to be represented as a unit distance graphs and as a strict unit distance graph.[2]
The minimum number of complete bipartite subgraphs needed to cover the edges of a crown graph (its bipartite dimension, or the size of a minimum biclique cover) is
- [math]\displaystyle{ \sigma(n)=\min \left\{\,k \mid n \le \binom{k}{\lfloor k/2 \rfloor} \,\right\}, }[/math]
the inverse function of the central binomial coefficient.[3]
The complement graph of a 2n-vertex crown graph is the Cartesian product of complete graphs K2 ▢ Kn, or equivalently the 2 × n rook's graph.
Applications
In etiquette, a traditional rule for arranging guests at a dinner table is that men and women should alternate positions, and that no married couple should sit next to each other.[4] The arrangements satisfying this rule, for a party consisting of n married couples, can be described as the Hamiltonian cycles of a crown graph. For instance, the arrangements of vertices shown in the figure can be interpreted as seating charts of this type in which each husband and wife are seated as far apart as possible. The problem of counting the number of possible seating arrangements, or almost equivalently[5] the number of Hamiltonian cycles in a crown graph, is known in combinatorics as the ménage problem; for crown graphs with 6, 8, 10, ... vertices the number of (oriented) Hamiltonian cycles is
Crown graphs can be used to show that greedy coloring algorithms behave badly in the worst case: if the vertices of a crown graph are presented to the algorithm in the order u0, v0, u1, v1, etc., then a greedy coloring uses n colors, whereas the optimal number of colors is two. This construction is attributed to (Johnson 1974); crown graphs are sometimes called Johnson’s graphs with notation Jn.[6] (Fürer 1995) uses crown graphs as part of a construction showing hardness of approximation of coloring problems.
(Matoušek 1996) uses distances in crown graphs as an example of a metric space that is difficult to embed into a normed vector space.
As (Miklavič Potočnik) show, crown graphs are one of a small number of different types of graphs that can occur as distance-regular circulant graphs.
(Agarwal Alon) describe polygons that have crown graphs as their visibility graphs; they use this example to show that representing visibility graphs as unions of complete bipartite graphs may not always be space-efficient.
A crown graph with 2n vertices, with its edges oriented from one side of the bipartition to the other, forms the standard example of a partially ordered set with order dimension n.
Notes
- ↑ Chaudhary & Vishwanathan (2001).
- ↑ Erdős & Simonovits (1980).
- ↑ de Caen, Gregory & Pullman (1981).
- ↑ Fox, Sue (2011), Etiquette For Dummies (2nd ed.), John Wiley & Sons, p. 244, ISBN 9781118051375, https://books.google.com/books?id=HGno_t1crwwC&pg=PA224
- ↑ In the ménage problem, the starting position of the cycle is considered significant, so the number of Hamiltonian cycles and the solution to the ménage problem differ by a factor of 2n.
- ↑ Kubale (2004).
References
- "Can visibility graphs be represented compactly?", Discrete and Computational Geometry 12 (1): 347–365, 1994, doi:10.1007/BF02574385.
- "Cycle systems in the complete bipartite graph minus a one-factor", Discrete Mathematics 284 (1–3): 37–43, 2004, doi:10.1016/j.disc.2003.11.021.
- Chaudhary, Amitabh; Vishwanathan, Sundar (2001), "Approximation algorithms for the achromatic number", Journal of Algorithms 41 (2): 404–416, doi:10.1006/jagm.2001.1192.
- Cadogan, Charles C., ed. (1981), "The Boolean rank of zero-one matrices", Proc. 3rd Caribbean Conference on Combinatorics and Computing, Department of Mathematics, University of the West Indies, pp. 169–173.
- "On the chromatic number of geometric graphs", Ars Combinatoria 9: 229–246, 1980, https://www.renyi.hu/~p_erdos/1980-25.pdf.
- Fürer, Martin (1995), "Improved hardness results for approximating the chromatic number", Proceedings of IEEE 36th Annual Foundations of Computer Science, pp. 414–421, doi:10.1109/SFCS.1995.492572, ISBN 978-0-8186-7183-8.
- Johnson, D. S. (1974), "Worst-case behavior of graph coloring algorithms", Proc. 5th Southeastern Conf. on Combinatorics, Graph Theory, and Computing, Utilitas Mathematicae, Winnipeg, pp. 513–527
- Kubale, M. (2004), Graph Colorings, American Mathematical Society, ISBN 978-0-8218-3458-9
- "On the distortion required for embedding finite metric spaces into normed spaces", Israel Journal of Mathematics 93 (1): 333–344, 1996, doi:10.1007/BF02761110.
- Miklavič, Štefko; Potočnik, Primož (2003), "Distance-regular circulants", European Journal of Combinatorics 24 (7): 777–784, doi:10.1016/S0195-6698(03)00117-3.
External links
 |  |
