EUVIMEDEUVIMED entdecken
Crossref

LACEABILITY PROPERTIES IN MYCIELSKI-TYPE GRAPHS

P. Gomathi, Silvia Leera Sequeira, Anthony Christy Melson, K. Bhuvaneswari, Yogalakshmi S.

Advances and Applications in Discrete Mathematics · 2026 · 43 (8) · 1097-1123

DOI: 10.17654/0974165826065 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Advances and Applications in Discrete Mathematics, 2026. Verfasst von P. Gomathi und 4 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A connected graph \(G\) is termed Hamiltonian-t-laceable if there exists in it a Hamiltonian path between every pair of vertices \(u\) and \(v\) such that \(d(u, v)=t\) for \(1 \leq t \leq \operatorname{diam}(G)\), where \(t\) is a positive integer. The Mycielski graph \(M(G)\) of a graph \(G\) is defined by a specific construction that increases the chromatic number while maintaining triangle-freeness. In this article, we investigate and exhibit laceability properties in the Mycielski-type graph \(M\left(C_{n}\right)\) of cycles for \(n \geq 4\).

Zitieren

APA

Gomathi, P., Sequeira, S. L., Melson, A. C., Bhuvaneswari, K., & S., Y. (2026). LACEABILITY PROPERTIES IN MYCIELSKI-TYPE GRAPHS. Advances and Applications in Discrete Mathematics, 43(8), 1097-1123. https://doi.org/10.17654/0974165826065

Vancouver

Gomathi P, Sequeira SL, Melson AC, Bhuvaneswari K, S. Y. LACEABILITY PROPERTIES IN MYCIELSKI-TYPE GRAPHS. Advances and Applications in Discrete Mathematics. 2026;43(8):1097-1123. doi:10.17654/0974165826065

BibTeX
@article{Gomathi2026,
  author = {Gomathi, P. and Sequeira, Silvia Leera and Melson, Anthony Christy and Bhuvaneswari, K. and S., Yogalakshmi},
  title = {LACEABILITY PROPERTIES IN MYCIELSKI-TYPE GRAPHS},
  journal = {Advances and Applications in Discrete Mathematics},
  year = {2026},
  volume = {43},
  number = {8},
  pages = {1097--1123},
  doi = {10.17654/0974165826065}
}
Kostenlos starten →