玫瑰窗图形的稳定性

Pub Date : 2024-08-05 DOI:10.1002/jgt.23162

Milad Ahanjideh, István Kovács, Klavdija Kutnar

{"title":"玫瑰窗图形的稳定性","authors":"Milad Ahanjideh, István Kovács, Klavdija Kutnar","doi":"10.1002/jgt.23162","DOIUrl":null,"url":null,"abstract":"A graph <math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>Γ</mi>\n </mrow>\n </mrow>\n <annotation> ${\\rm{\\Gamma }}$</annotation>\n </semantics></math> is said to be stable if for the direct product <math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>Γ</mi>\n \n <mo>×</mo>\n \n <msub>\n <mi>K</mi>\n \n <mn>2</mn>\n </msub>\n \n <mo>,</mo>\n \n <mtext>Aut</mtext>\n \n <mrow>\n <mo>(</mo>\n \n <mrow>\n <mi>Γ</mi>\n \n <mo>×</mo>\n \n <msub>\n <mi>K</mi>\n \n <mn>2</mn>\n </msub>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n </mrow>\n <annotation> ${\\rm{\\Gamma }}\\times {{\\bf{K}}}_{2},\\text{Aut}({\\rm{\\Gamma }}\\times {{\\bf{K}}}_{2})$</annotation>\n </semantics></math> is isomorphic to <math>\n <semantics>\n <mrow>\n \n <mrow>\n <mtext>Aut</mtext>\n \n <mrow>\n <mo>(</mo>\n \n <mi>Γ</mi>\n \n <mo>)</mo>\n </mrow>\n \n <mo>×</mo>\n \n <msub>\n <mi>Z</mi>\n \n <mn>2</mn>\n </msub>\n </mrow>\n </mrow>\n <annotation> $\\text{Aut}({\\rm{\\Gamma }})\\times {{\\mathbb{Z}}}_{2}$</annotation>\n </semantics></math>; otherwise, it is called unstable. An unstable graph is called nontrivially unstable when it is not bipartite and no two vertices have the same neighborhood. Wilson described nine families of unstable Rose Window graphs and conjectured that these contain all nontrivially unstable Rose Window graphs (2008). In this paper we show that the conjecture is true.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Stability of Rose Window graphs\",\"authors\":\"Milad Ahanjideh, István Kovács, Klavdija Kutnar\",\"doi\":\"10.1002/jgt.23162\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A graph <math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mi>Γ</mi>\\n </mrow>\\n </mrow>\\n <annotation> ${\\\\rm{\\\\Gamma }}$</annotation>\\n </semantics></math> is said to be stable if for the direct product <math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mi>Γ</mi>\\n \\n <mo>×</mo>\\n \\n <msub>\\n <mi>K</mi>\\n \\n <mn>2</mn>\\n </msub>\\n \\n <mo>,</mo>\\n \\n <mtext>Aut</mtext>\\n \\n <mrow>\\n <mo>(</mo>\\n \\n <mrow>\\n <mi>Γ</mi>\\n \\n <mo>×</mo>\\n \\n <msub>\\n <mi>K</mi>\\n \\n <mn>2</mn>\\n </msub>\\n </mrow>\\n \\n <mo>)</mo>\\n </mrow>\\n </mrow>\\n </mrow>\\n <annotation> ${\\\\rm{\\\\Gamma }}\\\\times {{\\\\bf{K}}}_{2},\\\\text{Aut}({\\\\rm{\\\\Gamma }}\\\\times {{\\\\bf{K}}}_{2})$</annotation>\\n </semantics></math> is isomorphic to <math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mtext>Aut</mtext>\\n \\n <mrow>\\n <mo>(</mo>\\n \\n <mi>Γ</mi>\\n \\n <mo>)</mo>\\n </mrow>\\n \\n <mo>×</mo>\\n \\n <msub>\\n <mi>Z</mi>\\n \\n <mn>2</mn>\\n </msub>\\n </mrow>\\n </mrow>\\n <annotation> $\\\\text{Aut}({\\\\rm{\\\\Gamma }})\\\\times {{\\\\mathbb{Z}}}_{2}$</annotation>\\n </semantics></math>; otherwise, it is called unstable. An unstable graph is called nontrivially unstable when it is not bipartite and no two vertices have the same neighborhood. Wilson described nine families of unstable Rose Window graphs and conjectured that these contain all nontrivially unstable Rose Window graphs (2008). In this paper we show that the conjecture is true.\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2024-08-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23162\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23162","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

如果图的直积与图同构，则称该图为稳定图；反之，则称该图为不稳定图。如果一个不稳定图不是两部分的，且没有两个顶点具有相同的邻域，则称为非两部分不稳定图。Wilson 描述了九个不稳定玫瑰窗图族，并猜想这些族包含所有非难不稳定玫瑰窗图（2008 年）。在本文中，我们证明了猜想的正确性。

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

查看原文

Stability of Rose Window graphs

A graph $Γ$ is said to be stable if for the direct product $Γ \times K_{2}, Aut (Γ \times K_{2})$ is isomorphic to $Aut (Γ) \times Z_{2}$ ; otherwise, it is called unstable. An unstable graph is called nontrivially unstable when it is not bipartite and no two vertices have the same neighborhood. Wilson described nine families of unstable Rose Window graphs and conjectured that these contain all nontrivially unstable Rose Window graphs (2008). In this paper we show that the conjecture is true.

求助全文

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