|
This article is cited in 2 scientific papers (total in 2 papers)
On the maximum number of open triangles in graphs with the same number of vertices and edges
A. V. Pyatkinab, O. I. Chernykhb a Sobolev Institute of Mathematics, 4 Acad. Koptyug Avenue, 630090 Novosibirsk, Russia
b Novosibirsk State University, 2 Pirogov Street, 630090 Novosibirsk, Russia
Abstract:
An open triangle (OT) is a $3$-vertex subgraph with two edges, i. e. an induced path of length $2$. A formula for the maximum number of OT in $n$-vertex graphs with $n$ edges is proved in the paper. We also present a full characterization of graphs for which the maximum is attained. Illustr. 2, bibliogr. 10.
Keywords:
open triangles, induced subgraphs, unicyclic graphs.
Received: 26.07.2021 Revised: 27.09.2021 Accepted: 28.09.2021
Citation:
A. V. Pyatkin, O. I. Chernykh, “On the maximum number of open triangles in graphs with the same number of vertices and edges”, Diskretn. Anal. Issled. Oper., 29:1 (2022), 46–55; J. Appl. Industr. Math., 16:1 (2022), 116–121
Linking options:
https://www.mathnet.ru/eng/da1292 https://www.mathnet.ru/eng/da/v29/i1/p46
|
|