✦ LIBER ✦

One conjecture of bubble-sort graphs

✍ Scribed by Hai-zhong Shi; Pan-feng Niu; Jian-bo Lu

Book ID: 108154782
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 187 KB
Volume: 111
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2011.06.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge-fault-tolerant edge-bipancyclicity

Edge-fault-tolerant edge-bipancyclicity of bubble-sort graphs

✍ Xin Ping Xu; Min Xu; Jin Jing 📂 Article 📅 2011 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 368 KB

An algorithm for disjoint paths in bubbl

An algorithm for disjoint paths in bubble-sort graphs

✍ Yasuto Suzuki; Keiichi Kaneko 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 518 KB

## Abstract An __n__‐dimensional bubble‐sort graph is regular and symmetric. It has __n__! nodes and (__n__−1)__n__!/2 edges while its connectivity and diameter are __n__−1 and __n__(__n__−1)/2, respectively. Bubble‐sort graphs are attracting attention because of their simple, symmetric, and recurs

Fault tolerance in bubble-sort graph net

Fault tolerance in bubble-sort graph networks

✍ Shiying Wang; Yuxing Yang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 281 KB

An efficient variation of bubble sort

✍ Wlodzimierz Dobosiewicz 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 131 KB

On the perfect graph conjecture

✍ H. Meyniel 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 160 KB

On a harmonious graph conjecture

✍ Eugene Levine 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 125 KB

Let K~ ) be the umon of two complete graphs on n vertices which have preosely one vertex in common. Graham and Sloane have shown that K~ ~ is not harmomous for n od:~, /(~,~ is harmonious, and K~62~ is not harmonious. They also conjecture that K~' t,, not h,~rmomous except for n = 4. Here, it Is sho