✦ LIBER ✦

Spectral bisection of graphs and connectedness

✍ Scribed by Urschel, John C.; Zikatanov, Ludmil T.

Book ID: 122308564
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 300 KB
Volume: 449
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2014.02.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Ranks and Representations for Spectral G

Ranks and Representations for Spectral Graph Bisection

✍ Martin, Jacob G.; Canfield, E. Rodney 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 293 KB

Bisections of graphs

✍ Lee, Choongbum; Loh, Po-Shen; Sudakov, Benny 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 458 KB

Connectednesses and disconnectednesses o

Connectednesses and disconnectednesses of graphs

✍ E. Fried; R. Wiegandt 📂 Article 📅 1975 🏛 Springer 🌐 English ⚖ 945 KB

Collapsible graphs and Hamiltonian conne

Collapsible graphs and Hamiltonian connectedness of line graphs

✍ Weihua Yang; Hongjian Lai; Hao Li; Xiaofeng Guo 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 223 KB

Bisection width of transposition graphs

✍ Ladislav Stacho; Imrich Vrt'o 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 894 KB

We prove lower and upper bounds on bisection width of transposition graphs. This class of graphs contains several frequently studied interconnection networks including star graphs and hypercubes. In particular, we prove that the bisection width of the complete transposition graph is of order O(n.n!)

Connectedness and structure in graphs

✍ G. A. Dirac 📂 Article 📅 1960 🏛 Springer Milan 🌐 Italian ⚖ 512 KB