Connected claw-free graphs whose second largest eigenvalue does not exceed 1
Discrete Mathematics · 2026-08 · 349 (8) · 115079
DOI: 10.1016/j.disc.2026.115079 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Mathematics, 2026-08. Verfasst von Chaohui Chen und 3 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 12 Literaturangaben. Gefördert von: Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja, National Natural Science Foundation of China, Natural Science Foundation of Guangdong Province.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja
- National Natural Science Foundation of China
- Natural Science Foundation of Guangdong Province
Zitieren
APA
Chen, C., Shan, H., Liu, M., & Stanić, Z. (2026). Connected claw-free graphs whose second largest eigenvalue does not exceed 1. Discrete Mathematics, 349(8), 115079. https://doi.org/10.1016/j.disc.2026.115079
Vancouver
Chen C, Shan H, Liu M, Stanić Z. Connected claw-free graphs whose second largest eigenvalue does not exceed 1. Discrete Mathematics. 2026;349(8):115079. doi:10.1016/j.disc.2026.115079
BibTeX
@article{Chen2026,
author = {Chen, Chaohui and Shan, Haiying and Liu, Muhuo and Stanić, Zoran},
title = {Connected claw-free graphs whose second largest eigenvalue does not exceed 1},
journal = {Discrete Mathematics},
year = {2026},
volume = {349},
number = {8},
pages = {115079},
doi = {10.1016/j.disc.2026.115079}
}
EUVIMED