关于少边图中开放三角形的最大数目

IF 0.58 Q3 Engineering

Journal of Applied and Industrial Mathematics Pub Date : 2024-12-01 DOI:10.1134/S1990478924030128

A. V. Pyatkin

{"title":"关于少边图中开放三角形的最大数目","authors":"A. V. Pyatkin","doi":"10.1134/S1990478924030128","DOIUrl":null,"url":null,"abstract":"<p> A three-vertex subset is called an open triangle (OT) if it induces a subgraph with exactly\ntwo edges. The problem of finding graphs with maximum number of OTs is considered. It is\nproved that, in case of sufficiently many vertices, such a graph is unique in the class of graphs\nwith constant difference between the numbers of edges and vertices.\n</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 3","pages":"516 - 520"},"PeriodicalIF":0.5800,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the Maximum Number of Open Triangles in Graphs with\\nFew Edges\",\"authors\":\"A. V. Pyatkin\",\"doi\":\"10.1134/S1990478924030128\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p> A three-vertex subset is called an open triangle (OT) if it induces a subgraph with exactly\\ntwo edges. The problem of finding graphs with maximum number of OTs is considered. It is\\nproved that, in case of sufficiently many vertices, such a graph is unique in the class of graphs\\nwith constant difference between the numbers of edges and vertices.\\n</p>\",\"PeriodicalId\":607,\"journal\":{\"name\":\"Journal of Applied and Industrial Mathematics\",\"volume\":\"18 3\",\"pages\":\"516 - 520\"},\"PeriodicalIF\":0.5800,\"publicationDate\":\"2024-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Applied and Industrial Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://link.springer.com/article/10.1134/S1990478924030128\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Engineering\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Applied and Industrial Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.1134/S1990478924030128","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}

引用次数: 0

摘要

一个三顶点的子集被称为开三角形（OT），如果它诱导出一个恰好有两条边的子图。考虑了寻找具有最大ot数的图的问题。证明了在顶点足够多的情况下，这样的图在边和顶点数差为常数的图类中是唯一的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On the Maximum Number of Open Triangles in Graphs with Few Edges

A three-vertex subset is called an open triangle (OT) if it induces a subgraph with exactly two edges. The problem of finding graphs with maximum number of OTs is considered. It is proved that, in case of sufficiently many vertices, such a graph is unique in the class of graphs with constant difference between the numbers of edges and vertices.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Applied and Industrial Mathematics Engineering-Industrial and Manufacturing Engineering

CiteScore

1.00

自引率

0.00%

发文量

期刊介绍： Journal of Applied and Industrial Mathematics is a journal that publishes original and review articles containing theoretical results and those of interest for applications in various branches of industry. The journal topics include the qualitative theory of differential equations in application to mechanics, physics, chemistry, biology, technical and natural processes; mathematical modeling in mechanics, physics, engineering, chemistry, biology, ecology, medicine, etc.; control theory; discrete optimization; discrete structures and extremum problems; combinatorics; control and reliability of discrete circuits; mathematical programming; mathematical models and methods for making optimal decisions; models of theory of scheduling, location and replacement of equipment; modeling the control processes; development and analysis of algorithms; synthesis and complexity of control systems; automata theory; graph theory; game theory and its applications; coding theory; scheduling theory; and theory of circuits.