On the Maximum Number of Open Triangles in Graphs with the Same Number of Vertices and Edges

Standard

On the Maximum Number of Open Triangles in Graphs with the Same Number of Vertices and Edges. / Pyatkin, A. V.; Chernykh, O. I.

в: Journal of Applied and Industrial Mathematics, Том 16, № 1, 02.2022, стр. 116-121.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

Harvard

Pyatkin, AV & Chernykh, OI 2022, 'On the Maximum Number of Open Triangles in Graphs with the Same Number of Vertices and Edges', Journal of Applied and Industrial Mathematics, Том. 16, № 1, стр. 116-121. https://doi.org/10.1134/S1990478922010112

APA

Pyatkin, A. V., & Chernykh, O. I. (2022). On the Maximum Number of Open Triangles in Graphs with the Same Number of Vertices and Edges. Journal of Applied and Industrial Mathematics, 16(1), 116-121. https://doi.org/10.1134/S1990478922010112

Vancouver

Pyatkin AV, Chernykh OI. On the Maximum Number of Open Triangles in Graphs with the Same Number of Vertices and Edges. Journal of Applied and Industrial Mathematics. 2022 февр.;16(1):116-121. doi: 10.1134/S1990478922010112

Author

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 ; Том 16, № 1. стр. 116-121.

BibTeX

@article{95d8c659139444dcb94ccfd4d6dce06b,

title = "On the Maximum Number of Open Triangles in Graphs with the Same Number of Vertices and Edges",

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.",

keywords = "induced subgraph, open triangle, unicyclic graph",

author = "Pyatkin, {A. V.} and Chernykh, {O. I.}",

note = "Funding Information: This work was supported by the Russian Foundation for Basic Research, project no. 20–01–00045. Publisher Copyright: {\textcopyright} 2022, Pleiades Publishing, Ltd.",

year = "2022",

month = feb,

doi = "10.1134/S1990478922010112",

language = "English",

volume = "16",

pages = "116--121",

journal = "Journal of Applied and Industrial Mathematics",

issn = "1990-4789",

publisher = "Maik Nauka-Interperiodica Publishing",

number = "1",

}

RIS

TY - JOUR

T1 - On the Maximum Number of Open Triangles in Graphs with the Same Number of Vertices and Edges

AU - Pyatkin, A. V.

AU - Chernykh, O. I.

PY - 2022/2

Y1 - 2022/2

N2 - 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.

AB - 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.

KW - induced subgraph

KW - open triangle

KW - unicyclic graph

UR - http://www.scopus.com/inward/record.url?scp=85134206583&partnerID=8YFLogxK

UR - https://www.mendeley.com/catalogue/1e563ca2-f65f-3e47-9ac9-7271e1b691b0/

U2 - 10.1134/S1990478922010112

DO - 10.1134/S1990478922010112

M3 - Article

AN - SCOPUS:85134206583

VL - 16

SP - 116

EP - 121

JO - Journal of Applied and Industrial Mathematics

JF - Journal of Applied and Industrial Mathematics

SN - 1990-4789

IS - 1

ER -

ID: 36770870