✦ LIBER ✦

Lattice bandwidth of random graphs

✍ Scribed by Colin McDiarmid; Zevi Miller

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On bandwidth sums of graphs

✍ Bing Yao; Jianfang Wang 📂 Article 📅 1995 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 395 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

Ramsey Theory and Bandwidth of Graphs

✍ Zoltán Füredi; Douglas B. West 📂 Article 📅 2001 🏛 Springer Japan 🌐 English ⚖ 114 KB

On the evolution of random graphs over e

On the evolution of random graphs over expanding square lattices

✍ K. Schürger 📂 Article 📅 1976 🏛 Akadmiai Kiad 🌐 English ⚖ 563 KB

Bandwidth of theta graphs with short pat

Bandwidth of theta graphs with short paths

✍ G.W. Peck; Aditya Shastri 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 628 KB

Peck, G.W. and A. Shastri, Bandwidth of theta graphs with short paths, Discrete Mathematics 103 (1992) 177-187. The bandwidth problem for a graph is that of labelling its vertices with distinct integers so that the maximum difference across an edge is minimized. We here solve this problem for all

Interval degree and bandwidth of a graph

✍ Fedor V Fomin; Petr A Golovach 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 395 KB

The interval degree id(G) of a graph G is deÿned to be the smallest max-degree of any interval supergraphs of G. One of the reasons for our interest in this parameter is that the bandwidth of a graph is always between id(G)=2 and id(G). We prove also that for any graph G the interval degree of G is