Hamiltonian path embedding and pancyclicity on the Möbius cube with faulty nodes and faulty edges

研究成果: Article同行評審

62 引文 斯高帕斯(Scopus)

摘要

A graph G = (V,E) is said to be pancyclic if it contains fault-free cycles of all lengths from 4 to V in G. Let Fv and e be the sets of faulty nodes and faulty edges of an n-dimensional Möbius cube MQn, respectively, and let F = Fv ∪ Fe. A faulty graph is pancyclic if it contains fault-free cycles of all lengths from 4 to V - Fv . In this paper, we show that MQn - F contains a fault-free Hamiltonian path when F ≤ n - 1 and n ≥ 1. We also show that MQn - F is pancyclic when F ≤ n - 2 and n ≥ 2. Since MQn is regular of degree n, both results are optimal in the worst case.

原文English
頁(從 - 到)854-863
頁數10
期刊IEEE Transactions on Computers
55
發行號7
DOIs
出版狀態Published - 2006 7月

All Science Journal Classification (ASJC) codes

  • 軟體
  • 理論電腦科學
  • 硬體和架構
  • 計算機理論與數學

指紋

深入研究「Hamiltonian path embedding and pancyclicity on the Möbius cube with faulty nodes and faulty edges」主題。共同形成了獨特的指紋。

引用此