CONSTRUCTIVE LOWER BOUNDS ON THE INDEPENDENCE NUMBERS OF DISTANCE GRAPHS WITH VERTICES IN {-1, 0, 1}
Проблемы передачи информации / Problems of Information Transmission · 2025
DOI: 10.7868/s3034583925020054 ↗Kurz gefasst
Fachartikel in der Zeitschrift Проблемы передачи информации / Problems of Information Transmission, 2025. Verfasst von A.R. Akhiiarov.
Abstract (Originalsprache)
New constructive lower bounds on the independence numbers of distance graphs with vertices in {-1, 0, 1} are presented. Asymptotically significant lower bounds valid for a wide range of parameters are obtained. Numerical calculations demonstrate relationships between the obtained results and known upper bounds.
Zitieren
APA
Akhiiarov, A. (2025). CONSTRUCTIVE LOWER BOUNDS ON THE INDEPENDENCE NUMBERS OF DISTANCE GRAPHS WITH VERTICES IN {-1, 0, 1}. Проблемы передачи информации / Problems of Information Transmission. https://doi.org/10.7868/s3034583925020054
Vancouver
Akhiiarov A. CONSTRUCTIVE LOWER BOUNDS ON THE INDEPENDENCE NUMBERS OF DISTANCE GRAPHS WITH VERTICES IN {-1, 0, 1}. Проблемы передачи информации / Problems of Information Transmission. 2025. doi:10.7868/s3034583925020054
BibTeX
@article{Akhiiarov2025,
author = {Akhiiarov, A.R.},
title = {CONSTRUCTIVE LOWER BOUNDS ON THE INDEPENDENCE NUMBERS OF DISTANCE GRAPHS WITH VERTICES IN -1, 0, 1},
journal = {Проблемы передачи информации / Problems of Information Transmission},
year = {2025},
doi = {10.7868/s3034583925020054}
}
EUVIMED