具有相同独立支配数的单环图的刻画

IF 3.6 1区数学 Q1 MATHEMATICS, APPLIED Mathematical Models & Methods in Applied Sciences Pub Date : 2023-01-01 DOI:10.12988/ams.2023.917395

Min-Jen Jou, Jenq-Jong Lin, Guan-Yu Lin

{"title":"具有相同独立支配数的单环图的刻画","authors":"Min-Jen Jou, Jenq-Jong Lin, Guan-Yu Lin","doi":"10.12988/ams.2023.917395","DOIUrl":null,"url":null,"abstract":"A set D of vertices of G is an independent dominating set if no two vertices of D are adjacent and every vertex not in D is adjacent to at lest one vertex in D . The independent domination number of a graph G , denoted by i ( G ), is the minimum cardinality of an independent dominating set in G . A unicyclic graph is a connected graph containing exactly one cycle. For k ≥ 1, let H ( k ) be the set of unicyclic graphs H satisfying i ( H ) = k . In this paper, we provide a constructive characterization of H ( k ) for all k ≥ 1.","PeriodicalId":49860,"journal":{"name":"Mathematical Models & Methods in Applied Sciences","volume":"1 1","pages":""},"PeriodicalIF":3.6000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A characterization of unicyclic graphs with the same independent domination number\",\"authors\":\"Min-Jen Jou, Jenq-Jong Lin, Guan-Yu Lin\",\"doi\":\"10.12988/ams.2023.917395\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A set D of vertices of G is an independent dominating set if no two vertices of D are adjacent and every vertex not in D is adjacent to at lest one vertex in D . The independent domination number of a graph G , denoted by i ( G ), is the minimum cardinality of an independent dominating set in G . A unicyclic graph is a connected graph containing exactly one cycle. For k ≥ 1, let H ( k ) be the set of unicyclic graphs H satisfying i ( H ) = k . In this paper, we provide a constructive characterization of H ( k ) for all k ≥ 1.\",\"PeriodicalId\":49860,\"journal\":{\"name\":\"Mathematical Models & Methods in Applied Sciences\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":3.6000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematical Models & Methods in Applied Sciences\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.12988/ams.2023.917395\",\"RegionNum\":1,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical Models & Methods in Applied Sciences","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.12988/ams.2023.917395","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}

引用次数: 0

摘要

G的顶点集合D是一个独立支配集，如果D中没有两个顶点相邻，并且不在D中的每个顶点至少与D中的一个顶点相邻。图G的独立支配数用i (G)表示，它是G中独立支配集的最小基数。单环图是只包含一个环的连通图。当k≥1时，设H (k)为满足i (H) = k的单环图H的集合。在本文中，我们给出了所有k≥1时H (k)的构造性质。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

A characterization of unicyclic graphs with the same independent domination number

A set D of vertices of G is an independent dominating set if no two vertices of D are adjacent and every vertex not in D is adjacent to at lest one vertex in D . The independent domination number of a graph G , denoted by i ( G ), is the minimum cardinality of an independent dominating set in G . A unicyclic graph is a connected graph containing exactly one cycle. For k ≥ 1, let H ( k ) be the set of unicyclic graphs H satisfying i ( H ) = k . In this paper, we provide a constructive characterization of H ( k ) for all k ≥ 1.

求助全文

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

来源期刊

Mathematical Models & Methods in Applied Sciences 数学-应用数学

CiteScore

6.30

自引率

17.10%

发文量

审稿时长

1 months

期刊介绍： The purpose of this journal is to provide a medium of exchange for scientists engaged in applied sciences (physics, mathematical physics, natural, and technological sciences) where there exists a non-trivial interplay between mathematics, mathematical modelling of real systems and mathematical and computer methods oriented towards the qualitative and quantitative analysis of real physical systems. The principal areas of interest of this journal are the following: 1.Mathematical modelling of systems in applied sciences; 2.Mathematical methods for the qualitative and quantitative analysis of models of mathematical physics and technological sciences; 3.Numerical and computer treatment of mathematical models or real systems. Special attention will be paid to the analysis of nonlinearities and stochastic aspects. Within the above limitation, scientists in all fields which employ mathematics are encouraged to submit research and review papers to the journal. Both theoretical and applied papers will be considered for publication. High quality, novelty of the content and potential for the applications to modern problems in applied sciences and technology will be the guidelines for the selection of papers to be published in the journal. This journal publishes only articles with original and innovative contents. Book reviews, announcements and tutorial articles will be featured occasionally.