Skip to main navigation Skip to search Skip to main content

Wirelength of 1-fault hamiltonian graphs into wheels and fans

  • M. Arockiaraj*
  • , Paul Manuel
  • , Indra Rajasingh
  • , Bharati Rajan
  • *Corresponding author for this work
  • Department of Mathematics
  • Loyola College India

Research output: Contribution to journal › Article › peer-review

43 Scopus citations

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 languageEnglish
Pages (from-to)921-925
Number of pages5
JournalInformation Processing Letters
Volume111
Issue number18
DOIs
StatePublished - 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