On Graphs with Small Number of Edges Having ExtremalNumber of Open Triangles Full article
| Journal |
Journal of Applied and Industrial Mathematics
ISSN: 1990-4789 , E-ISSN: 1990-4797 |
||
|---|---|---|---|
| Output data | Year: 2025, Volume: 19, Number: 2, Pages: 313-321 Pages count : 9 DOI: 10.1134/s1990478925020103 | ||
| Tags | open triangle, induced subgraph, sparse graph | ||
| Authors |
|
||
| Affiliations |
|
Funding (1)
| 1 | Sobolev Institute of Mathematics | FWNF-2022-0019 |
Abstract:
In an undirected graph, a 3-vertex induced subgraph having exactly 2 edges is called an open triangle (OT). We consider the class of graphs where the difference between the numbers of edges and vertices is a fixed constant c. The complete characterization of graphs on at least c + 7 vertices with the maximum number of OTs is obtained for this class.
Cite:
Pyatkin A.V.
On Graphs with Small Number of Edges Having ExtremalNumber of Open Triangles
Journal of Applied and Industrial Mathematics. 2025. V.19. N2. P.313-321. DOI: 10.1134/s1990478925020103 Scopus РИНЦ OpenAlex
On Graphs with Small Number of Edges Having ExtremalNumber of Open Triangles
Journal of Applied and Industrial Mathematics. 2025. V.19. N2. P.313-321. DOI: 10.1134/s1990478925020103 Scopus РИНЦ OpenAlex
Original:
Пяткин А.В.
Об экстремальных по числу открытых треугольников графах с малым числом рёбер
Дискретный анализ и исследование операций. 2025. Т.32. №2. С.107-121. DOI: 10.33048/daio.2025.32.830 РИНЦ
Об экстремальных по числу открытых треугольников графах с малым числом рёбер
Дискретный анализ и исследование операций. 2025. Т.32. №2. С.107-121. DOI: 10.33048/daio.2025.32.830 РИНЦ
Dates:
| Submitted: | Mar 19, 2025 |
| Accepted: | Apr 22, 2025 |
| Published print: | Apr 1, 2026 |
| Published online: | Apr 1, 2026 |
Identifiers:
| ≡ Scopus: | 2-s2.0-105035381991 |
| ≡ Elibrary: | 89161727 |
| ≡ OpenAlex: | W7147278655 |