关于最大度为4的3-色图的色顶点稳定性

IF 1 Q1 MATHEMATICS

Discrete Mathematics Letters Pub Date : 2022-05-04 DOI:10.47443/dml.2022.066

M. Knor, Mirko Petruvsevski, Riste vSkrekovski

{"title":"关于最大度为4的3-色图的色顶点稳定性","authors":"M. Knor, Mirko Petruvsevski, Riste vSkrekovski","doi":"10.47443/dml.2022.066","DOIUrl":null,"url":null,"abstract":"The (independent) chromatic vertex stability (ivs χ ( G )) vs χ ( G ) is the minimum size of (independent) set S ⊆ V ( G ) such that χ ( G − S ) = χ ( G ) − 1. In this paper we construct inﬁnitely many graphs G with ∆( G ) = 4, χ ( G ) = 3, ivs χ ( G ) = 3 and vs χ ( G ) = 2, which gives a partial negative answer to a problem posed in [3].","PeriodicalId":36023,"journal":{"name":"Discrete Mathematics Letters","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2022-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On Chromatic Vertex Stability of 3-Chromatic Graphs With Maximum Degree 4\",\"authors\":\"M. Knor, Mirko Petruvsevski, Riste vSkrekovski\",\"doi\":\"10.47443/dml.2022.066\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The (independent) chromatic vertex stability (ivs χ ( G )) vs χ ( G ) is the minimum size of (independent) set S ⊆ V ( G ) such that χ ( G − S ) = χ ( G ) − 1. In this paper we construct inﬁnitely many graphs G with ∆( G ) = 4, χ ( G ) = 3, ivs χ ( G ) = 3 and vs χ ( G ) = 2, which gives a partial negative answer to a problem posed in [3].\",\"PeriodicalId\":36023,\"journal\":{\"name\":\"Discrete Mathematics Letters\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2022-05-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics Letters\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.47443/dml.2022.066\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics Letters","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.47443/dml.2022.066","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

(独立)色顶点稳定性(ivs χ (G)) vs χ (G)是(独立)集合S的最小规模，使χ (G−S) = χ (G)−1。本文构造了无穷多个图G，其中∆(G) = 4， χ (G) = 3, ivs χ (G) = 3, vs χ (G) = 2，给出了[3]中问题的部分负解。

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

查看原文本刊更多论文

On Chromatic Vertex Stability of 3-Chromatic Graphs With Maximum Degree 4

The (independent) chromatic vertex stability (ivs χ ( G )) vs χ ( G ) is the minimum size of (independent) set S ⊆ V ( G ) such that χ ( G − S ) = χ ( G ) − 1. In this paper we construct inﬁnitely many graphs G with ∆( G ) = 4, χ ( G ) = 3, ivs χ ( G ) = 3 and vs χ ( G ) = 2, which gives a partial negative answer to a problem posed in [3].

求助全文

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

来源期刊

Discrete Mathematics Letters Mathematics-Discrete Mathematics and Combinatorics

CiteScore

1.50

自引率

12.50%

发文量

审稿时长

12 weeks