EUVIMEDEUVIMED entdecken
Crossref

The g-good-neighbor diagnosability of lexicographic product networks under the PMC model

Ayun Zhang, Zhao Wang, Jinning Zhao, Yaping Mao, Eddie Cheng

Theoretical Computer Science · 2026-05 · 1073 · 115904

DOI: 10.1016/j.tcs.2026.115904 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-05. Verfasst von Ayun Zhang und 4 weiteren Autor:innen. Die Arbeit nennt 39 Literaturangaben. Gefördert von: Fundamental Research Funds for the Provincial Universities of Zhejiang, National Natural Science Foundation of China, Qinghai University.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • Fundamental Research Funds for the Provincial Universities of Zhejiang
  • National Natural Science Foundation of China
  • Qinghai University
  • Natural Science Foundation of Qinghai
  • Zhejiang Province Natural Science Foundation

Zitieren

APA

Zhang, A., Wang, Z., Zhao, J., Mao, Y., & Cheng, E. (2026). The g-good-neighbor diagnosability of lexicographic product networks under the PMC model. Theoretical Computer Science, 1073, 115904. https://doi.org/10.1016/j.tcs.2026.115904

Vancouver

Zhang A, Wang Z, Zhao J, Mao Y, Cheng E. The g-good-neighbor diagnosability of lexicographic product networks under the PMC model. Theoretical Computer Science. 2026;1073:115904. doi:10.1016/j.tcs.2026.115904

BibTeX
@article{Zhang2026,
  author = {Zhang, Ayun and Wang, Zhao and Zhao, Jinning and Mao, Yaping and Cheng, Eddie},
  title = {The g-good-neighbor diagnosability of lexicographic product networks under the PMC model},
  journal = {Theoretical Computer Science},
  year = {2026},
  volume = {1073},
  pages = {115904},
  doi = {10.1016/j.tcs.2026.115904}
}
Kostenlos starten →