✦ LIBER ✦

Another characterization of the centroid of a tree

✍ Scribed by Sandra L. Mitchell

Publisher: Elsevier Science
Year: 1978
Tongue: English
Weight: 478 KB
Volume: 24
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(78)90098-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Least central subtrees, center, and cent

Least central subtrees, center, and centroid of a tree

✍ Martti Hamina; Matti Peltola 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 99 KB

Characterization of a Branch of the Phyl

Characterization of a Branch of the Phylogenetic Tree

✍ STUART A. SAMUEL; GEZHI WENG 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 287 KB

We use a combination of analytic models and computer simulations to gain insight into the dynamics of evolution. Our results suggest that certain interesting phenomena should eventually emerge from the fossil record. For example, there should be a "tortoise and hare effect": those genera with the sm

A characterization of bivariegated trees

✍ A.R. Bednarek; E.L. Sanders 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 938 KB

A @mph ix biwwiepted PO itr vertca; Jiet c"8n be partitioned into two equal sets such that e&t WPWQ is od@tuxnt to me and only one vertex in the set not containing it. A tree with 2~ verlh & bivaticgatcd Of an," mly if the largest indcpcndcnt subset of the vertex set hw uxdind n. A constructive desc

A characterization of k-trees

✍ Ralf Fröberg 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 147 KB

The purpose of this note is to give a local criterion for a graph to be a k-tree. We show that a connected graph with the right number of edges is a k-tree if and only if the neighbourhood of each vertex is a (k -l)-tree.

Another characterization of hypercubes

✍ Jean-Marie Laborde; Surya Prakash Rao Hebbare 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 547 KB

Nous montrons que dans la classe des graphes connexes tels ;lue deux a&es incidentes quelconques appartiennent a un et un seul quadrilatere, les hypercrtbes finis sont les graphes de degre minimum n lini et possedant 2" sommets. The fol!owing theorem' is proved: Let % be the class of connected grap

Another Characterization of the Natural

Another Characterization of the Natural Numbers

✍ Thomjas Bedürftig 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB