Premium
Remarks on the placeability of isomorphic trees in a complete graph
Author(s) -
Hasunuma Toru,
Shibata Yukio
Publication year - 1996
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/(sici)1097-0118(199601)21:1<41::aid-jgt5>3.0.co;2-m
Subject(s) - combinatorics , mathematics , graph , order (exchange) , degree (music) , tree (set theory) , discrete mathematics , physics , finance , acoustics , economics
Let T p be any tree of order p and Δ( T p ) stand for the maximum degree of the vertices of T p . We prove the following theorem. “If Δ T p ≤ p − i , where p > 2i , then T p is i ‐placeable in K p ” is true if and only if i = 1,2, and 3. © 1996 John Wiley & Sons, Inc.