✦ LIBER ✦

All-port line broadcasting in highly connected graphs

✍ Scribed by Iris Gaber; Michal Parnas

Publisher: John Wiley and Sons
Year: 2005
Tongue: English
Weight: 161 KB
Volume: 45
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20055

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

All 4-connected Line Graphs of Claw Free

All 4-connected Line Graphs of Claw Free Graphs Are Hamiltonian Connected

✍ Matthias Kriesell 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 109 KB

Thomassen conjectured that every 4-connected line graph is hamiltonian. Here we shall see that 4-connected line graphs of claw free graphs are hamiltonian connected.

Broadcasting in All-Output-Port Meshes o

Broadcasting in All-Output-Port Meshes of Trees with Distance-Insensitive Switching

✍ Petr Salinger; Pavel Tvrdı́k 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 648 KB

Meshes of trees are hybrids of meshes and trees with outstanding properties, namely small degree and diameter and large bisection width. Moreover, they are known to be area universal, i.e., they can simulate any network with the same wire area with only a polylogarithmic slowdown. Meshes of trees ar

Eulerian subgraphs in 3-edge-connected g

Eulerian subgraphs in 3-edge-connected graphs and Hamiltonian line graphs

✍ Zhi-Hong Chen; Hong-Jian Lai; Xiangwen Li; Deying Li; Jinzhong Mao 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB

## Abstract In this paper, we show that if __G__ is a 3‐edge‐connected graph with $S \subseteq V(G)$ and $|S| \le 12$, then either __G__ has an Eulerian subgraph __H__ such that $S \subseteq V(H)$, or __G__ can be contracted to the Petersen graph in such a way that the preimage of each vertex of th