Let Tp be any tree of order p and A ( T p ) stand for the maximum degree of the vertices of Tp. We prove the following theorem. "If A(Tp) 5 pi, where p > 2i, then Tp is i-placeable in Kp" is true if and only if i = 1, 2, and 3. 0 1996 John Wiley & Sons, Inc. Suppose G is a graph and V ( G ) , E ( G
✦ LIBER ✦
A note on -placeable graphs
✍ Scribed by Andrzej Żak
- Book ID
- 113567406
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 173 KB
- Volume
- 311
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Remarks on the placeability of isomorphi
✍
Hasunuma, Toru; Shibata, Yukio
📂
Article
📅
1996
🏛
John Wiley and Sons
🌐
English
⚖ 99 KB
👁 3 views
The number of labeled graphs placeable b
✍
Hasunuma, Toru; Shibata, Yukio
📂
Article
📅
1996
🏛
John Wiley and Sons
🌐
English
⚖ 370 KB
👁 2 views
Let S be a finite set and u a permutation on S. The permutation u\* on the set of 2-subsets of S is naturally induced by u. Suppose G is a graph and V(G), €(G) are the vertex set, the edge set, respectively. Let V(G) = S. If €(G) and u\*(€(G)), the image of €(G) by u\*, have no common element, then
A note on compact graphs
✍
G. Tinhofer
📂
Article
📅
1991
🏛
Elsevier Science
🌐
English
⚖ 736 KB
A note on cospectral graphs
✍
Charles R Johnson; Morris Newman
📂
Article
📅
1980
🏛
Elsevier Science
🌐
English
⚖ 544 KB
A note on Cayley graphs
✍
Marston Conder
📂
Article
📅
1986
🏛
Elsevier Science
🌐
English
⚖ 483 KB
A note on perfect graphs
✍
K. Cameron; J. Edmonds; L. Lovász
📂
Article
📅
1986
🏛
Springer Netherlands
🌐
English
⚖ 164 KB