Results

eNauka >  Rezultati >  Connected (K_4 - e)-free graphs whose second largest eigenvalue does not exceed 1
Naziv: Connected (K_4 - e)-free graphs whose second largest eigenvalue does not exceed 1
Autori: Liu, Muhuo; Chen, Chaohui; Stanic, Zoran  
Godina: 2024
Publikacija: European Journal of Combinatorics
ISSN: 0195-6698 European Journal of Combinatorics Pretraži identifikator
Tip rezultata: Naučni članak
Kolacija: vol. 115 str. Аrticle no. 103775
DOI: 10.1016/j.ejc.2023.103775
WoS-ID: 001063057700001
Scopus-ID: 2-s2.0-85167450294
URI: https://enauka.gov.rs/handle/123456789/832259
Projekat: Natural Science Foundation of Guangdong Province, China [2022A1515011786]
National Natural Science Foundation of China [12271182]
SCSG-ctct - Spectrally constrained signed graphs with applications in coding theory and control theory
Izvor metapodataka: (Preuzeto iz CrossRef-a) Stanić, Zoran
(Preuzeto iz Nasi u WoS)
M-kategorija: 
21M21 - Vodeći međunarodni časopis kategorije M21

7
SCOPUSTM
7
WEB OF SCIENCETM
Altmetric
Dimensions
Unpaywall

Items in eNauka are protected by copyright, with all rights reserved, unless otherwise indicated.