{"title":"图稳定性的几个条件","authors":"Ademir Hujdurović, Ðorđe Mitrović","doi":"10.1002/jgt.23018","DOIUrl":null,"url":null,"abstract":"<p>A graph <math>\n <semantics>\n <mrow>\n <mi>X</mi>\n </mrow>\n <annotation> $X$</annotation>\n </semantics></math> is said to be <i>unstable</i> if the direct product <math>\n <semantics>\n <mrow>\n <mi>X</mi>\n \n <mo>×</mo>\n \n <msub>\n <mi>K</mi>\n \n <mn>2</mn>\n </msub>\n </mrow>\n <annotation> $X\\times {K}_{2}$</annotation>\n </semantics></math> (also called the <i>canonical double cover</i> of <math>\n <semantics>\n <mrow>\n <mi>X</mi>\n </mrow>\n <annotation> $X$</annotation>\n </semantics></math>) has automorphisms that do not come from automorphisms of its factors <math>\n <semantics>\n <mrow>\n <mi>X</mi>\n </mrow>\n <annotation> $X$</annotation>\n </semantics></math> and <math>\n <semantics>\n <mrow>\n <msub>\n <mi>K</mi>\n \n <mn>2</mn>\n </msub>\n </mrow>\n <annotation> ${K}_{2}$</annotation>\n </semantics></math>. It is <i>nontrivially unstable</i> if it is unstable, connected, nonbipartite, and distinct vertices have distinct sets of neighbours. In this paper, we prove two sufficient conditions for stability of graphs in which every edge lies on a triangle, revising an incorrect claim of Surowski and filling in some gaps in the proof of another one. We also consider triangle-free graphs, and prove that there are no nontrivially unstable triangle-free graphs of diameter 2. An interesting construction of nontrivially unstable graphs is given and several open problems are posed.</p>","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"105 1","pages":"98-109"},"PeriodicalIF":0.9000,"publicationDate":"2023-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jgt.23018","citationCount":"2","resultStr":"{\"title\":\"Some conditions implying stability of graphs\",\"authors\":\"Ademir Hujdurović, Ðorđe Mitrović\",\"doi\":\"10.1002/jgt.23018\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>A graph <math>\\n <semantics>\\n <mrow>\\n <mi>X</mi>\\n </mrow>\\n <annotation> $X$</annotation>\\n </semantics></math> is said to be <i>unstable</i> if the direct product <math>\\n <semantics>\\n <mrow>\\n <mi>X</mi>\\n \\n <mo>×</mo>\\n \\n <msub>\\n <mi>K</mi>\\n \\n <mn>2</mn>\\n </msub>\\n </mrow>\\n <annotation> $X\\\\times {K}_{2}$</annotation>\\n </semantics></math> (also called the <i>canonical double cover</i> of <math>\\n <semantics>\\n <mrow>\\n <mi>X</mi>\\n </mrow>\\n <annotation> $X$</annotation>\\n </semantics></math>) has automorphisms that do not come from automorphisms of its factors <math>\\n <semantics>\\n <mrow>\\n <mi>X</mi>\\n </mrow>\\n <annotation> $X$</annotation>\\n </semantics></math> and <math>\\n <semantics>\\n <mrow>\\n <msub>\\n <mi>K</mi>\\n \\n <mn>2</mn>\\n </msub>\\n </mrow>\\n <annotation> ${K}_{2}$</annotation>\\n </semantics></math>. It is <i>nontrivially unstable</i> if it is unstable, connected, nonbipartite, and distinct vertices have distinct sets of neighbours. In this paper, we prove two sufficient conditions for stability of graphs in which every edge lies on a triangle, revising an incorrect claim of Surowski and filling in some gaps in the proof of another one. We also consider triangle-free graphs, and prove that there are no nontrivially unstable triangle-free graphs of diameter 2. An interesting construction of nontrivially unstable graphs is given and several open problems are posed.</p>\",\"PeriodicalId\":16014,\"journal\":{\"name\":\"Journal of Graph Theory\",\"volume\":\"105 1\",\"pages\":\"98-109\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2023-08-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jgt.23018\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Graph Theory\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23018\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Graph Theory","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23018","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
A graph is said to be unstable if the direct product (also called the canonical double cover of ) has automorphisms that do not come from automorphisms of its factors and . It is nontrivially unstable if it is unstable, connected, nonbipartite, and distinct vertices have distinct sets of neighbours. In this paper, we prove two sufficient conditions for stability of graphs in which every edge lies on a triangle, revising an incorrect claim of Surowski and filling in some gaps in the proof of another one. We also consider triangle-free graphs, and prove that there are no nontrivially unstable triangle-free graphs of diameter 2. An interesting construction of nontrivially unstable graphs is given and several open problems are posed.
期刊介绍:
The Journal of Graph Theory is devoted to a variety of topics in graph theory, such as structural results about graphs, graph algorithms with theoretical emphasis, and discrete optimization on graphs. The scope of the journal also includes related areas in combinatorics and the interaction of graph theory with other mathematical sciences.
A subscription to the Journal of Graph Theory includes a subscription to the Journal of Combinatorial Designs .