✦ LIBER ✦

Spectral Diameter Estimates for k-Regular Graphs

✍ Scribed by G. Quenell

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 666 KB
Volume: 106
Category: Article
ISSN: 0001-8708
DOI: 10.1006/aima.1994.1052

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the k-diameter of k-regular k-connect

On the k-diameter of k-regular k-connected graphs

✍ D. Frank Hsu; Tomasz Łuczak 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 391 KB

We study the k-diameter of k-regular k-connected graphs. Among other results, we show that every k-regular k-connected graph on n vertices has k-diameter at most n/2 and this upper bound cannot be improved when n = 4k -6 + i(2k -4). In particular, the maximal 3-diameter of 3-regular graphs with 2n v

Diameter bounds for altered graphs

✍ F. R. K. Chung; M. R. Garey 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 928 KB

The main question addressed in this article is the following: If t edges are removed from a ( t + 1) edge-connected graph G having diameter D, how large can the diameter of the resulting graph be? (The diameter of a graph is the maximum, over all pairs of vertices, of the length of the shortest path

RRT: The Regularized Resolvent Transform

RRT: The Regularized Resolvent Transform for High-Resolution Spectral Estimation

✍ Jianhan Chen; A.J Shaka; Vladimir A Mandelshtam 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 125 KB

A new numerical expression, called the regularized resolvent transform (RRT), is presented. RRT is a direct transformation of the truncated time-domain data into a frequency-domain spectrum and is suitable for high-resolution spectral estimation of multidimensional time signals. One of its forms, un

Sufficient conditions for a graph to be

Sufficient conditions for a graph to be λk-optimal with given girth and diameter

✍ Zhao Zhang; Qinghai Liu 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 198 KB

An algorithm for construction of a k-con

An algorithm for construction of a k-connected graph with minimum number of edges and quasiminimal diameter

✍ Ulrich Schumacher 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 470 KB

Two fundamental considerations in the design of a communication network are reliability and maximum transmission delay. In this paper we give an algorithm for construction of an undirected graph with n vertices in which there are k node-disjoint paths between any two nodes. The generated graphs will