✦ LIBER ✦

On repeated interchange graphs. II

✍ Scribed by V.V Menon

Book ID: 107883972
Publisher: Elsevier Science
Year: 1971
Tongue: English
Weight: 178 KB
Volume: 11
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(71)90013-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the groups of repeated graphs

✍ Frucht, Robert 📂 Article 📅 1949 🏛 American Mathematical Society 🌐 English ⚖ 244 KB

On the upper bound of the diameter of in

On the upper bound of the diameter of interchange graphs

✍ Jianguo Qian 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 308 KB

Note on graphs without repeated cycle le

Note on graphs without repeated cycle lengths

✍ Chen, Guantao; Lehel, Jen�; Jacobson, Michael S.; Shreve, Warren E. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 225 KB 👁 1 views

In this note we prove that every 2-connected graph of order n with no repeated cycle lengths has at most n + 2(n -2) -1 edges and we show this result is best possible with the correct order of magnitude on √ n. The 2connected case is also used to give a quick proof of Lai's result on the general cas

Interlacings for Random Walks on Weighte

Interlacings for Random Walks on Weighted Graphs and the Interchange Process

✍ Dieker, A. B. 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 235 KB

On regular graphs. II

✍ D.Z̆ Djoković 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 411 KB

On the graph for which there is a tree a

On the graph for which there is a tree as the inverse interchange graph of a local graph

✍ Juhani Nieminen 📂 Article 📅 1972 🏛 Springer 🌐 English ⚖ 347 KB