✦ LIBER ✦

Generalized vertex-rankings of trees

✍ Scribed by Xiao Zhou; Nobuaki Nagai; Takao Nishizeki

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 622 KB
Volume: 56
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(95)00172-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Chromatic polynomials of generalized tre

Chromatic polynomials of generalized trees

✍ Earl Glen Whitehead Jr. 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 184 KB

Generalized Vertex Algebras Generated by

Generalized Vertex Algebras Generated by Parafermion-Like Vertex Operators

✍ Yongcun Gao; Haisheng Li 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 231 KB

It is proved that for any vector space W, any set of parafermion-like vertex operators on W in a certain canonical way generates a generalized vertex algebra in the sense of Dong and Lepowsky with W as a natural module. As an application, generalized vertex algebras are constructed from the Lepowsky

The generalized Randić index of trees

✍ Paul Balister; Béla Bollobás; Stefanie Gerke 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 241 KB

## Abstract The generalized Randić; index ${R}\_{-\alpha}(T)$ of a tree __T__ is the sum over the edges ${u}{v}$ of __T__ of $(d(u)d(v))^{-\alpha}$ where ${d}(x)$ is the degree of the vertex __x__ in __T__. For all $\alpha > 0$, we find the minimal constant $\beta\_{0}=\beta\_{0}(\alpha)$ such that

On Minimum Edge Ranking Spanning Trees

✍ Kazuhisa Makino; Yushi Uno; Toshihide Ibaraki 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 243 KB

In this paper, we introduce the problem of computing a minimum edge ranking spanning tree (MERST); i.e., find a spanning tree of a given graph G whose edge ranking is minimum. Although the minimum edge ranking of a given tree can be computed in polynomial time, we show that problem MERST is NP-hard.

Packing k-edge trees in graphs of restri

Packing k-edge trees in graphs of restricted vertex degrees

✍ A.K. Kelmans 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 368 KB 👁 1 views

## Abstract Let ${\cal G}^{s}\_{r}$ denote the set of graphs with each vertex of degree at least __r__ and at most __s__, __v__(__G__) the number of vertices, and τ~__k__~ (__G__) the maximum number of disjoint __k__‐edge trees in __G__. In this paper we show that if __G__ ∈ ${\cal G}^{s}\_{2}$ a

Edge and vertex intersection of paths in

Edge and vertex intersection of paths in a tree

✍ Martin Charles Golumbic; Robert E. Jamison 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 572 KB