✦ LIBER ✦

Maximum energy trees with two maximum degree vertices

✍ Scribed by Xueliang Li; Xiangmei Yao; Jianbin Zhang; Ivan Gutman

Publisher: Springer
Year: 2008
Tongue: English
Weight: 370 KB
Volume: 45
Category: Article
ISSN: 0259-9791
DOI: 10.1007/s10910-008-9394-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the maximal energy tree with two maxi

On the maximal energy tree with two maximum degree vertices

✍ Jing Li; Xueliang Li; Yongtang Shi 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 264 KB

Cycles through vertices of large maximum

Cycles through vertices of large maximum degree

✍ Bill Jackson 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 442 KB

## Abstract Let __G__ be a 2‐connected graph on __n__ vertices with maximum degree __k__ where __n__ ≤ 3__k__ ‐ 2. We show that there is a cycle in __G__ that contains all vertices of degree __k.__ © 1995 John Wiley & Sons, Inc.

Cycles containing all vertices of maximu

Cycles containing all vertices of maximum degree

✍ H. J. Broersma; J. Den Van Heuvel; H. A. Jung; H. J. Veldman 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 539 KB

## Abstract For a graph __G__ and an integer __k__, denote by __V__~__k__~ the set {__v__ ∈ __V__(__G__) | __d__(__v__) ≥ __k__}. Veldman proved that if __G__ is a 2‐connected graph of order __n__ with __n__ ≤ __3k ‐ 2__ and |__V__~__k__~| ≤ __k__, then __G__ has a cycle containing all vertices of

Bipartite labeling of trees with maximum

Bipartite labeling of trees with maximum degree three

✍ Bonnington, C. Paul; ?ir�?, Jozef 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 258 KB 👁 3 views

Let T = (V, E) be a tree with a properly 2-colored vertex set. A bipartite labeling of T is a bijection ϕ: V → {1, . . . , |V |} for which there exists a k such that whenever ϕ(u) ≤ k < ϕ(v), then u and v have different colors. The α-size α(T ) of the tree T is the maximum number of elements in the

Maximum Randić index on Trees withk-pend

Maximum Randić index on Trees withk-pendant Vertices

✍ Lian-Zhu Zhang; Mei Lu; Feng Tian 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 161 KB

On numbers of vertices of maximum degree

On numbers of vertices of maximum degree in the spanning trees of a graph

✍ Jerzy Topp; Preben D. Vestergaard 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 611 KB

For a connected graph G, let ~-(G) be the set of all spanning trees of G and let nd(G) be the number of vertices of maximum degree in G. In this paper we show that if G is a cactus or a connected graph with p vertices and p+ 1 edges, then the set {na(T) : T C ~-(G)) has at most one gap, that is, it