✦ LIBER ✦

Bandwidth of the composition of two graphs

✍ Scribed by Toru Kojima

Book ID: 108315891
Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 165 KB
Volume: 270
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(03)00131-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On bandwidth and edgesum for the composi

On bandwidth and edgesum for the composition of two graphs

✍ Jiuqiang Liu; Kenneth Williams 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 469 KB

The composition of two graphs G and H, written G[H], is the graph with vertex set V(G) x V(H) and with (u,, uI) adjacent to (ul, ul) if either u1 is adjacent to IQ in G or u1 = u2 and ul is adjacent to v2 in H. In this paper, we investigate the bandwidth problem for the composition of two graphs and

Harper-type lower bounds and the bandwid

Harper-type lower bounds and the bandwidths of the compositions of graphs

✍ Sanming Zhou; Jinjiang Yuan 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 541 KB

Edge-Bandwidth of Graphs

✍ Jiang, Tao; Mubayi, Dhruv; Shastri, Aditya; West, Douglas B. 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 288 KB

On the group of the composition of two g

On the group of the composition of two graphs

✍ Harary, Frank 📂 Article 📅 1959 🏛 Duke University Press 🌐 English ⚖ 612 KB

The edge-bandwidth of theta graphs

✍ Dennis Eichhorn; Dhruv Mubayi; Kevin O'Bryant; Douglas B. West 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB

An edge-labeling f of a graph G is an injection from E(G) to the set of integers. The edge-bandwidth of G is B H (G) min f {B H (f )}, where B H (f ) is the maximum difference between labels of incident edges of G. The theta graph Â(l 1 , F F F ,l m ) is the graph consisting of m pairwise internally

Computing the Bandwidth of Interval Grap

Computing the Bandwidth of Interval Graphs

✍ Kleitman, Daniel J.; Vohra, Rakesh V. 📂 Article 📅 1990 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 414 KB