© On orthogonal inclusion graphs of odd characteristic
Journal of Discrete Mathematical Sciences & Cryptography · 2026 · 29 (4) · 1863-1875
DOI: 10.47974/jdmsc-2654 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Discrete Mathematical Sciences & Cryptography, 2026. Verfasst von Siripong Sirisuk und 1 weiteren Autor:innen.
Abstract (Originalsprache)
An orthogonal inclusion graph is constructed from totally isotropic subspaces of an orthogonal space over a finite field of odd characteristic with a finite dimension. Its vertices correspond to all nontrivial totally isotropic subspaces, with two vertices adjacent whenever one is a proper subset of the other. In this work, we determine the independence number and the domination number of this graph in dimension 4.
Zitieren
APA
Sirisuk, S., & Sriwongsa, S. (2026). © On orthogonal inclusion graphs of odd characteristic. Journal of Discrete Mathematical Sciences & Cryptography, 29(4), 1863-1875. https://doi.org/10.47974/jdmsc-2654
Vancouver
Sirisuk S, Sriwongsa S. © On orthogonal inclusion graphs of odd characteristic. Journal of Discrete Mathematical Sciences & Cryptography. 2026;29(4):1863-1875. doi:10.47974/jdmsc-2654
BibTeX
@article{Sirisuk2026,
author = {Sirisuk, Siripong and Sriwongsa, Songpon},
title = {© On orthogonal inclusion graphs of odd characteristic},
journal = {Journal of Discrete Mathematical Sciences & Cryptography},
year = {2026},
volume = {29},
number = {4},
pages = {1863--1875},
doi = {10.47974/jdmsc-2654}
}
EUVIMED