Abstract
In this paper we obtain a fundamental result to find the exact wirelength of 1-fault hamiltonian graphs into wheels and fans. Using this result we compute the exact wirelength of circulant graphs, generalized Petersen graphs, augmented cubes, crossed cubes, Mobius cubes, locally twisted cubes, twisted cubes, twisted n-cubes, generalized twisted cubes, hierarchical cubic networks, alternating group graphs, arrangement graphs and tori into wheels and fans. In addition, we find the exact wirelength of hypercubes, folded hypercubes, shuffle cubes, cube connected cycles, cyclic-cubes, wrapped butterfly networks and star graphs into fans.
| Original language | English |
|---|---|
| Pages (from-to) | 921-925 |
| Number of pages | 5 |
| Journal | Information Processing Letters |
| Volume | 111 |
| Issue number | 18 |
| DOIs | |
| State | Published - 30 Sep 2011 |
Keywords
- Algorithms
- Congestion
- Embedding
- Wirelength
- f-fault hamiltonian
Fingerprint
Dive into the research topics of 'Wirelength of 1-fault hamiltonian graphs into wheels and fans'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver