๐”– Bobbio Scriptorium
โœฆ   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

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

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