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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bollobás, B.: Extremal Graph Theory. Academic Press, London (1978)
Bollobás, B., Cockayne, E.J.: More rotation numbers for complete bipartite graphs. J. Graph Theory6 403–411 (1982)
Bollobás, B., Cockayne, E.J., Yao, F.Z.: Rotation numbers for unions of circuits. J. Graph Theory8 69–81 (1984)
Cockayne, E.J., Lorimer, P.J.: On rotation numbers for complete bipartite graphs. University of Victoria, Department of Mathematics Report DM-186-IR (1979)
Cockayne, E.J., Yao, F.Z.: Rotation numbers for unions of triangles and circuits. Ann. of Discrete Math.17 203–209 (1983)
Haviland, J.: Cliques and independent sets. Ph.D. Thesis, University of Cambridge (1989)
Haviland, J., Thomason, A.: Rotation numbers for complete bipartite graphs. (submitted)
Author information
Authors and Affiliations
Additional information
Funded by the Science and Engineering Research Council.
Rights and permissions
About this article
Cite this article
Haviland, J., Thomason, A. Rotation numbers for complete tripartite graphs. Graphs and Combinatorics 7, 153–163 (1991). https://doi.org/10.1007/BF01788140
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01788140