On the Maximum Number of Open Triangles in Graphs with Few Edges Full article
| Journal |
Journal of Applied and Industrial Mathematics
ISSN: 1990-4789 , E-ISSN: 1990-4797 |
||
|---|---|---|---|
| Output data | Year: 2024, Volume: 18, Number: 3, Pages: 516-520 Pages count : 5 DOI: 10.1134/S1990478924030128 | ||
| Tags | open triangle, induced subgraph, sparse graph | ||
| Authors |
|
||
| Affiliations |
|
Funding (1)
| 1 | Sobolev Institute of Mathematics | FWNF-2022-0019 |
Abstract:
A three-vertex subset is called an open triangle (OT) if it induces a subgraph with exactlytwo edges. The problem of finding graphs with maximum number of OTs is considered. It isproved that, in case of sufficiently many vertices, such a graph is unique in the class of graphswith constant difference between the numbers of edges and vertices.
Cite:
Pyatkin A.V.
On the Maximum Number of Open Triangles in Graphs with Few Edges
Journal of Applied and Industrial Mathematics. 2024. V.18. N3. P.516-520. DOI: 10.1134/S1990478924030128 Scopus РИНЦ OpenAlex
On the Maximum Number of Open Triangles in Graphs with Few Edges
Journal of Applied and Industrial Mathematics. 2024. V.18. N3. P.516-520. DOI: 10.1134/S1990478924030128 Scopus РИНЦ OpenAlex
Original:
Пяткин А.В.
О максимальном числе открытых треугольников в графах с малым числом рёбер
Дискретный анализ и исследование операций. 2024. Т.31. №3. С.134-142. DOI: 10.33048/daio.2024.31.793 РИНЦ
О максимальном числе открытых треугольников в графах с малым числом рёбер
Дискретный анализ и исследование операций. 2024. Т.31. №3. С.134-142. DOI: 10.33048/daio.2024.31.793 РИНЦ
Dates:
| Submitted: | Jan 25, 2024 |
| Accepted: | Mar 22, 2024 |
| Published print: | Dec 1, 2024 |
| Published online: | Dec 1, 2024 |
Identifiers:
| Scopus: | 2-s2.0-85211203843 |
| Elibrary: | 75143772 |
| OpenAlex: | W4404901215 |
Citing:
Пока нет цитирований