Koh, Rogers and Tan (Discrete Math. 25 (1979) [141][142][143][144][145][146][147][148] give a method to construct a bigger graceful tree from two graceful trees. Based upon their results, we give a new construction, which allows us to prove that the subdivision graph of a graceful tree is still a gr
โฆ LIBER โฆ
On the graph for which there is a tree as the inverse interchange graph of a local graph
โ Scribed by Juhani Nieminen
- Publisher
- Springer
- Year
- 1972
- Tongue
- English
- Weight
- 347 KB
- Volume
- 7
- Category
- Article
- ISSN
- 0025-2611
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The subdivision graph of a graceful tree
โ
M. Burzio; G. Ferrarese
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 253 KB
The weak limit of Ising models on locall
โ
Andrea Montanari; Elchanan Mossel; Allan Sly
๐
Article
๐
2010
๐
Springer
๐
English
โ 263 KB
On the multiplicities of eigenvalues of
โ
C. M. Da Fonseca
๐
Article
๐
2007
๐
Springer
๐
English
โ 188 KB
A characterization on graphs which achie
โ
Kinkar Ch. Das
๐
Article
๐
2004
๐
Elsevier Science
๐
English
โ 215 KB
A note on the tree decompositions of gra
โ
Shi Minyong
๐
Article
๐
1997
๐
Springer
๐
English
โ 288 KB
The inverse inertia problem for graphs:
โ
Wayne Barrett; H. Tracy Hall; Raphael Loewy
๐
Article
๐
2009
๐
Elsevier Science
๐
English
โ 528 KB
Let G be an undirected graph on n vertices and let S(G) be the set of all real symmetric n ร n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. The inverse inertia problem for G asks which inertias can be attained by a matrix in S(G). We giv