EUVIMEDEUVIMED entdecken
Crossref

Hamiltonicity in The Chained Cubic Tree Interconnection Network $CCT(h,n)$

R. A. D. Singh, A. Y. Raj

Malaysian Journal of Mathematical Sciences · 29.06.2026 · 20 (2) · 847

DOI: 10.47836/mjms.20.2.20 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Malaysian Journal of Mathematical Sciences, online erschienen am 29.06.2026. Verfasst von R. A. D. Singh und 1 weiteren Autor:innen. Die Arbeit nennt 18 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Hamiltonicity plays a crucial role in the design of efficient interconnection networks, as it facilitatesoptimal routing of information between processors. The study of Hamiltonicity has inspired the development of several related concepts such as Hamiltonian laceability and Hamiltonian connectedness, fault tolerance and path covers etc., have lot of significance in computer networks as the presence of Hamiltonian path in network graphs is vital for addressing data communication challenges. A connected graph $G$ is described as Hamiltonian - t_{odd}(t_{even}) - laceable if for every pair of vertices x and y, there exists a Hamiltonian path such that the distance $ds(x,y) =t$ where $t$ is any odd (even) value satisfying $1 \le t \le D_m(G)$ with $D_m(G)$ representing the graph’s diameter. Furthermore, $G$ is Hamiltonian−$t$−connected when it satisfies Hamiltonian−$t$−laceable condition for every t in the range $1 \le t \le D_m(G)$. This article examines the Hamiltonian todd−laceability and Hamiltonian t_{\mathrm{even}}$-laceability properties of a chained cubic tree interconnection network, denoted as $CCT(h, n)$ specifically for $h = 1, \; n \ge 2$. The study’s findings emphasize the distance specific Hamiltonian−t−connectedness of $CCT(h, n)$ characterized by $ds(x,y) = t$, for 1 $\le t \le D_m(G).$

Zitieren

APA

Singh, R. A. D., & Raj, A. Y. (2026). Hamiltonicity in The Chained Cubic Tree Interconnection Network $CCT(h,n)$. Malaysian Journal of Mathematical Sciences, 20(2), 847. https://doi.org/10.47836/mjms.20.2.20

Vancouver

Singh RAD, Raj AY. Hamiltonicity in The Chained Cubic Tree Interconnection Network $CCT(h,n)$. Malaysian Journal of Mathematical Sciences. 2026;20(2):847. doi:10.47836/mjms.20.2.20

BibTeX
@article{Singh2026,
  author = {Singh, R. A. D. and Raj, A. Y.},
  title = {Hamiltonicity in The Chained Cubic Tree Interconnection Network $CCT(h,n)$},
  journal = {Malaysian Journal of Mathematical Sciences},
  year = {2026},
  volume = {20},
  number = {2},
  pages = {847},
  doi = {10.47836/mjms.20.2.20}
}
Kostenlos starten →