有符号书图的色多项式

Q4 Mathematics

Theory and Applications of Graphs Pub Date : 2022-03-24 DOI:10.20429/tag.2022.090104

Deepak Sehrawat, B. Bhattacharjya

{"title":"有符号书图的色多项式","authors":"Deepak Sehrawat, B. Bhattacharjya","doi":"10.20429/tag.2022.090104","DOIUrl":null,"url":null,"abstract":"For m ≥ 3 and n ≥ 1, the m -cycle book graph B ( m, n ) consists of n copies of the cycle C m with one common edge. In this paper, we prove that (a) the number of switching non-isomorphic signed B ( m, n ) is n + 1, and (b) the chromatic number of a signed B ( m, n ) is either 2 or 3. We also obtain explicit formulas for the chromatic polynomials and the zero-free chromatic polynomials of switching non-isomorphic signed book graphs.","PeriodicalId":37096,"journal":{"name":"Theory and Applications of Graphs","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Chromatic Polynomials of Signed Book Graphs\",\"authors\":\"Deepak Sehrawat, B. Bhattacharjya\",\"doi\":\"10.20429/tag.2022.090104\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For m ≥ 3 and n ≥ 1, the m -cycle book graph B ( m, n ) consists of n copies of the cycle C m with one common edge. In this paper, we prove that (a) the number of switching non-isomorphic signed B ( m, n ) is n + 1, and (b) the chromatic number of a signed B ( m, n ) is either 2 or 3. We also obtain explicit formulas for the chromatic polynomials and the zero-free chromatic polynomials of switching non-isomorphic signed book graphs.\",\"PeriodicalId\":37096,\"journal\":{\"name\":\"Theory and Applications of Graphs\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-03-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Theory and Applications of Graphs\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.20429/tag.2022.090104\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theory and Applications of Graphs","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.20429/tag.2022.090104","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}

引用次数: 0

摘要

对于m≥3和n≥1，m-循环书图B（m，n）由具有一个公共边的循环Cm的n个副本组成。本文证明了（a）切换非同构有符号B（m，n）的个数为n+1，（B）有符号B的色数为2或3。我们还得到了切换非同构有符号书图的色多项式和零自由色多项式的显式公式。

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

查看原文本刊更多论文

Chromatic Polynomials of Signed Book Graphs

For m ≥ 3 and n ≥ 1, the m -cycle book graph B ( m, n ) consists of n copies of the cycle C m with one common edge. In this paper, we prove that (a) the number of switching non-isomorphic signed B ( m, n ) is n + 1, and (b) the chromatic number of a signed B ( m, n ) is either 2 or 3. We also obtain explicit formulas for the chromatic polynomials and the zero-free chromatic polynomials of switching non-isomorphic signed book graphs.

求助全文

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

来源期刊

Theory and Applications of Graphs Mathematics-Discrete Mathematics and Combinatorics

CiteScore

0.70

自引率

0.00%

发文量

审稿时长

20 weeks