✦ LIBER ✦

On an edge ranking problem of trees and graphs

✍ Scribed by Ananth.V. Iyer; H.Donald Ratliff; Gopalakrishnan Vijayan

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 724 KB
Volume: 30
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(91)90012-l

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Unranking and ranking spanning trees of

Unranking and ranking spanning trees of a graph

✍ Charles J Colbourn; Robert P.J Day; Louis D Nel 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 845 KB

Edge search in graphs and hypergraphs of

Edge search in graphs and hypergraphs of bounded rank

✍ Ingo Althöfer; Eberhard Triesch 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 512 KB

Althofer, 1. and E. Triesch, Edge search in graphs and hypergraphs of bounded rank, Discrete Mathematics 115 (1993) l-9.

On the complexity of graph tree partitio

On the complexity of graph tree partition problems

✍ Roberto Cordone; Francesco Maffioli 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 270 KB

This paper concerns the optimal partition of a graph into p connected clusters of vertices, with various constraints on their topology and weight. We consider di erent objectives, depending on the cost of the trees spanning the clusters. This rich family of problems mainly applies to telecommunicati

On the edge forwarding index problem for

On the edge forwarding index problem for small graphs

✍ Abdelmadjid Bouabdallah; Dominique Sotteau 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 540 KB

On low bound of degree sequences of span

On low bound of degree sequences of spanning trees inK-edge-connected graphs

✍ Zhenhong, Liu; Baoguang, Xu 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 257 KB 👁 3 views

[•] is a lower integer form and α depends on k. We show that every k-edge-connected graph with k ≥ 2, has a d k -tree, and α = 1 for k = 2, α = 2 for k ≥ 3.

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