𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Strong elimination ordering of the total graph of a tree

✍ Scribed by J. Aleš; R. Bačík

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
287 KB
Volume
39
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generating and characterizing the perfec
Generating and characterizing the perfect elimination orderings of a chordal graph
✍ L.S. Chandran; L. Ibarra; F. Ruskey; J. Sawada 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 402 KB

We develop a constant time transposition "oracle" for the set of perfect elimination orderings of chordal graphs. Using this oracle, we can generate a Gray code of all perfect elimination orderings in constant amortized time using known results about antimatroids. Using clique trees, we show how the

The subdivision graph of a graceful tree
The subdivision graph of a graceful tree is 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 ordering of trees and connected grap
The ordering of trees and connected graphs by algebraic connectivity
✍ Jia-Yu Shao; Ji-Ming Guo; Hai-Ying Shan 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 235 KB

In this paper, we first determine that the first four trees of order n 9 with the smallest algebraic connectivity are P n , Q n , W n and Z n with α(P n ) < α(Q n ) < α(W n ) < α(Z n ) < α(T ), where T is any tree of order n other than P n , Q n , W n , and Z n . Then we consider the effect on the L