{"title":"On Graphs with Small Number of Edges Having Extremal\u0000Number of Open Triangles","authors":"A. V. Pyatkin","doi":"10.1134/S1990478925020103","DOIUrl":"10.1134/S1990478925020103","url":null,"abstract":"<p> In an undirected graph, a 3-vertex induced subgraph having exactly 2 edges is called\u0000an open triangle (OT). We consider the class of graphs where the difference between the numbers\u0000of edges and vertices is a fixed constant\u0000<span>( c )</span>. The complete characterization of graphs on at least\u0000<span>( c+7 )</span> vertices with the maximum number of OTs is obtained for this class.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"19 2","pages":"313 - 321"},"PeriodicalIF":0.58,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147579346","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}