๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the maximal energy tree with two maximum degree vertices

โœ Scribed by Jing Li; Xueliang Li; Yongtang Shi

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
264 KB
Volume
435
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A spanning tree of the 2m-dimensional hy
A spanning tree of the 2m-dimensional hypercube with maximum number of degree-preserving vertices
โœ Sul-young Choi; Puhua Guan ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 190 KB

For an n-dimensional hypercube Q., the maximum number of degree-preserving vertices in a spanning tree is 2"jn if n = 2" for an integer M. (If n # 2", then the maximum number of degree-preserving vertices in a spanning tree is less than 2"/n.) We also construct a spanning tree of Qzm with maximum nu

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

On the construction of maximum residual
On the construction of maximum residual energy resource broadcast trees with minimum diameter in static ad hoc wireless networks
โœ Chor Ping Low; Lai Woen Goh ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 186 KB ๐Ÿ‘ 1 views

Each node in a wireless ad hoc network runs on a local energy source that has a limited energy life span. Thus, energy conservation is a critical issue in such networks. In addition, it is in general desirable to construct routes with low hop counts as a route with a high hop count is more likely to