✦ LIBER ✦

On Exponential Trees

✍ Scribed by D. Fon–Der–Flaass

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 82 KB
Volume: 19
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.1997.1799

No coin nor oath required. For personal study only.

✦ Synopsis

We give a necessary and sufficient condition for a tree from a certain class to have exponential growth rate (in the sense of [1]). The class contains, in particular, all trees of bounded valency; and also includes the class of trees without end-vertices which was considered in [1].

📜 SIMILAR VOLUMES

Tree-Structured Exponential Regression M

Tree-Structured Exponential Regression Modeling

✍ Hongshik Ahn 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 793 KB

An Exponential Formula for Polynomial Ve

An Exponential Formula for Polynomial Vector Fields: II. Lie Series, Exponential Substituition, and Rooted Trees

✍ Rudolf Winkel 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 413 KB

Gro bner's Lie Series and the Exponential Formula provide different explicit formulas for the flow generated by a finite-dimensional polynomial vector field. The present paper gives (1) a generalization of the Lie series in case of non-commuting variables called Exponential Substituition, (2) a stru

Classification of localized melanoma by

Classification of localized melanoma by the exponential survival trees method

✍ Xin Huang; Seng-jaw Soong; William H. McCarthy; Marshall M. Urist; Charles M. Ba 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB 👁 1 views

## BACKGROUND. Over the past 2 decades, remarkable progress has been made in the Xin Huang, Ph.D

On q-trees

✍ Chong-Yun Chao; Nian-Zu Li; Shao-Ji Xu 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 301 KB

We show that a graph G with n vertices is a q-tree if and only if its chromatic polynomial is P(G,A) = A(A -I)...(A -q + l ) ( As ) " -~ where n L q. The graphs which we consider here are finite, undirected, simple, and loopless. Let q be an integer L 1. The graphs called q-trees are defined by re

On zero-trees

✍ Zoltán Füredi; D. J. Kleitman 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 544 KB

## Abstract Consider an integer‐valued function on the edge‐set of the complete graph K~m+1~. The weight of an edge‐subset is defined to be the sum of the associated weights. It is proved that there exists a spanning tree with weight 0 modulo __m__.

On Exponential Stability ofC0Semigroups

✍ Yue-Hu Luo; De-Xing Feng 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 174 KB

In this note, the exponential stability for C semigroups in a Hilbert space is 0 considered. First, an expression for a C semigroup is given, and then a formula on 0 the growth order of a C semigroup is obtained. Finally, with some additional 0 condition such as the boundedness of the resolvent of t