Graphs and Combinatorics

, Volume 7, Issue 2, pp 153–163

Rotation numbers for complete tripartite graphs

• Julie Haviland
• Andrew Thomason
Original Papers

Abstract

Arooted graph is a pair (G, x), whereG is a simple undirected graph andx ∈ V(G). IfG is rooted atx, then itsrotation number h(G, x) is the minimum number of edges in a graphF of the same order asG such that for allv ∈ V(F), we can find a copy ofG inF with the rootx atv. Rotation numbers for all complete bipartite graphs are now known (see [2], [4], [7]). In this paper we calculate rotation numbers for complete tripartite graphs with rootx in the largest vertex class.

Keywords

Bipartite Graph Undirected Graph Rotation Number Complete Bipartite Graph Tripartite Graph
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

1. 1.
2. 2.
Bollobás, B., Cockayne, E.J.: More rotation numbers for complete bipartite graphs. J. Graph Theory6 403–411 (1982)Google Scholar
3. 3.
Bollobás, B., Cockayne, E.J., Yao, F.Z.: Rotation numbers for unions of circuits. J. Graph Theory8 69–81 (1984)Google Scholar
4. 4.
Cockayne, E.J., Lorimer, P.J.: On rotation numbers for complete bipartite graphs. University of Victoria, Department of Mathematics Report DM-186-IR (1979)Google Scholar
5. 5.
Cockayne, E.J., Yao, F.Z.: Rotation numbers for unions of triangles and circuits. Ann. of Discrete Math.17 203–209 (1983)Google Scholar
6. 6.
Haviland, J.: Cliques and independent sets. Ph.D. Thesis, University of Cambridge (1989)Google Scholar
7. 7.
Haviland, J., Thomason, A.: Rotation numbers for complete bipartite graphs. (submitted)Google Scholar