On the Minimal Number of Edges in Induced Subgraphs of Special Distance Graphs

被引：0

|

作者：

Ya. K. Shubin

机构：

[1] Lomonosov Moscow State University,

来源：

Mathematical Notes | 2022年 / 111卷

关键词：

distance graphs; Johnson graphs;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

页码：961 / 969

页数：8

相关论文

共 50 条

[21] Circular chromatic number of induced subgraphs of Kneser graphs
Alishahi, Meysam
Taherkhani, Ali
ARS MATHEMATICA CONTEMPORANEA, 2018, 15 (01) : 161 - 172
[22] On chromatic number of graphs without certain induced subgraphs
Duan, Fang
Wu, Baoyindureng
ARS COMBINATORIA, 2011, 101 : 33 - 44
[23] Maximising the number of connected induced subgraphs of unicyclic graphs
Dossou-Olory, Audace A. V.
TURKISH JOURNAL OF MATHEMATICS, 2022, 46 (08) : 3359 - 3372
[24] On the number of connected subgraphs of graphs
Dinesh Pandey
Kamal Lochan Patra
Indian Journal of Pure and Applied Mathematics, 2021, 52 : 571 - 583
[25] On the number of connected subgraphs of graphs
Pandey, Dinesh
Patra, Kamal Lochan
INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 2021, 52 (02): : 571 - 583
[26] A BOUND ON THE CHROMATIC NUMBER OF GRAPHS WITHOUT CERTAIN INDUCED SUBGRAPHS
WAGON, S
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1980, 29 (03) : 345 - 346
[27] Estimate of the Number of Edges in Subgraphs of a Johnson Graph
Pushnyakov, F. A.
Raigorodskii, A. M.
DOKLADY MATHEMATICS, 2021, 104 (01) : 193 - 195
[28] Bounds for the number of mappings of graphs and for the number of subgraphs
Leontovich, A.M.
Problems of information transmission, 1988, 23 (04) : 296 - 311
[29] Estimate of the Number of Edges in Subgraphs of a Johnson Graph
F. A. Pushnyakov
A. M. Raigorodskii
Doklady Mathematics, 2021, 104 : 193 - 195
[30] On subgraphs in distance-regular graphs
Koolen, J.H.
Journal of Algebraic Combinatorics, 1992, 1 (04):

← 1 2 3 4 5 →