On the Maximum Number of Open Triangles in Graphs with the Same Number of Vertices and Edges Full article
| Journal |
Journal of Applied and Industrial Mathematics
ISSN: 1990-4789 , E-ISSN: 1990-4797 |
||||
|---|---|---|---|---|---|
| Output data | Year: 2022, Volume: 16, Number: 1, Pages: 116-121 Pages count : 6 DOI: 10.1134/S1990478922010112 | ||||
| Tags | induced subgraph; open triangle; unicyclic graph | ||||
| Authors |
|
||||
| Affiliations |
|
Funding (1)
| 1 | Russian Foundation for Basic Research | 20-01-00045 |
Abstract:
Abstract: An open triangle is a 3-vertex subgraph with two edges, i.e., an induced path of length 2. A formula for the maximum number of open triangles in n-vertex graphs with n edges is proved in the paper. We also present a full characterization of graphsfor which the maximum is attained. © 2022, Pleiades Publishing, Ltd.
Cite:
Pyatkin A.V.
, Chernykh O.I.
On the Maximum Number of Open Triangles in Graphs with the Same Number of Vertices and Edges
Journal of Applied and Industrial Mathematics. 2022. V.16. N1. P.116-121. DOI: 10.1134/S1990478922010112 Scopus РИНЦ OpenAlex
On the Maximum Number of Open Triangles in Graphs with the Same Number of Vertices and Edges
Journal of Applied and Industrial Mathematics. 2022. V.16. N1. P.116-121. DOI: 10.1134/S1990478922010112 Scopus РИНЦ OpenAlex
Original:
Pyatkin A.V.
, Chernykh O.I.
О максимальном числе открытых треугольников в графах с одинаковым числом вершин и рёбер
Дискретный анализ и исследование операций. 2022. Т.29. №1. С.46-55. DOI: 10.33048/daio.2022.29.723 РИНЦ OpenAlex
О максимальном числе открытых треугольников в графах с одинаковым числом вершин и рёбер
Дискретный анализ и исследование операций. 2022. Т.29. №1. С.46-55. DOI: 10.33048/daio.2022.29.723 РИНЦ OpenAlex
Identifiers:
| Scopus: | 2-s2.0-85134206583 |
| Elibrary: | 51435040 |
| OpenAlex: | W4285410646 |