✦ LIBER ✦

The bandwidth of the complement of A K-TREE

✍ Scribed by Yuan Jinjiang; Lin Yixun

Book ID: 107502156
Publisher: SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year: 1998
Tongue: English
Weight: 189 KB
Volume: 13
Category: Article
ISSN: 1005-1031
DOI: 10.1007/s11766-998-0058-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bandwidth of the complete k-ary tree

✍ Lawren Smithline 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 524 KB

We determine, constructively, the bandwidth of the complete k-ary tree on d levels. By rectifying an algorithm of Chung (1988), we establish B( Tk,J = rk(kd -1)/(2d( k -1)) 1. ## 1. Praeludium The bandwidth problem for a graph G is a question about numbering the vertices of G so the maximum differ

The bandwidth of a tree with k leaves is

The bandwidth of a tree with k leaves is at most [k2]

✍ Kiyoshi Ando; Atsusi Kaneko; Severino Gervacio 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 171 KB

The bandwidth B(G) of a finite simple graph G is the minimum of the quantity max{ If(x)-f(Y)I:xyC E(G)} taken over all injective integer labellings f of G. We prove that if a tree T has k leaves then B(T)<~ [k/2~. This improves the previously known upper bound B(T)<.IV(T)I/2

On the Cutwidth and the Topological Band

On the Cutwidth and the Topological Bandwidth of a Tree

✍ Chung, Fan R. K. 📂 Article 📅 1985 🏛 Society for Industrial and Applied Mathematics ⚖ 947 KB

The least eigenvalue of the complements

The least eigenvalue of the complements of trees

✍ Yi-Zheng Fan; Fei-Fei Zhang; Yi Wang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 200 KB

Let T c n be the set of the complements of trees of order n. In this paper, we characterize the unique graph whose least eigenvalue attains the minimum among all graphs in T c n .

Cycles in the complement of a tree or ot

Cycles in the complement of a tree or other graph

✍ F.C. Holroyd; W.J.G. Wingate 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 745 KB

Formulas are obtained for the number of m-cycles, y,(G, n), and the number of all cycles, -r(G, n). in the complement of a graph G with respect to the complete graph K,, in terms of the 'linear forest array' of G. Some elementary properties of these arrays are obtained. Computer results are reported

The pagenumber of the class of bandwidth

The pagenumber of the class of bandwidth-k graphs is k − 1

✍ R.P Swaminathan; D Giriraj; D.K Bhatia 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 314 KB