Rotation numers for complete bipartite graphs | Zendy

Haviland Julie | Zendy; Thomason Andrew | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Rotation numers for complete bipartite graphs

Author(s) -

Haviland Julie,

Thomason Andrew

Publication year - 1992

Publication title -

journal of graph theory

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.164

H-Index - 54

eISSN - 1097-0118

pISSN - 0364-9024

DOI - 10.1002/jgt.3190160107

Subject(s) - combinatorics , mathematics , bipartite graph , complete bipartite graph , edge transitive graph , graph , discrete mathematics , graph power , line graph

A rooted graph is a pair ( G, x ) where G is a simple undirected graph and x ϵ V ( G ). If G if rooted at x , then its rotation number h(G, x) is teh minimum number of edges in a graph F , of the same order as G , such that for all v ϵ V(F) we can find a copy of G in F with the root x at v . Rotation numbers for complete bipartite graphs were itroduced in [4] by Cockayne and Lorimer. Several cases were evaluated by Bollobás and Cockayne in [2], and in this paper we give a full solution.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research