|
This article is cited in 4 scientific papers (total in 4 papers)
On the Minimal Number of Edges in Induced Subgraphs of Special Distance Graphs
Ya. K. Shubin Lomonosov Moscow State University
Abstract:
Three new theorems are proved in the paper, which give bounds for the number of edges in induced subgraphs of a special distance graph.
Keywords:
distance graphs, Johnson graphs.
Received: 23.11.2021 Revised: 29.01.2022
Citation:
Ya. K. Shubin, “On the Minimal Number of Edges in Induced Subgraphs of Special Distance Graphs”, Mat. Zametki, 111:6 (2022), 929–939; Math. Notes, 111:6 (2022), 961–969
Linking options:
https://www.mathnet.ru/eng/mzm13370https://doi.org/10.4213/mzm13370 https://www.mathnet.ru/eng/mzm/v111/i6/p929
|
Statistics & downloads: |
Abstract page: | 225 | Full-text PDF : | 43 | References: | 55 | First page: | 14 |
|