图连接中的弱连通2-支配

IF 3.6 1区数学 Q1 MATHEMATICS, APPLIED

Mathematical Models & Methods in Applied Sciences Pub Date : 2022-11-29 DOI:10.12988/ams.2021.914589

Mae P. Militante, R. G. Eballe, Rene E. Leonida

{"title":"图连接中的弱连通2-支配","authors":"Mae P. Militante, R. G. Eballe, Rene E. Leonida","doi":"10.12988/ams.2021.914589","DOIUrl":null,"url":null,"abstract":"A weakly connected 2-dominating set of a connected graph G is a set D ⊆ V (G) such that every vertex in V (G)\\D is adjacent to at least two vertices in D and the subgraph, 〈D〉w, weakly induced by D is connected. In this paper, the weakly connected 2-dominating sets in the join G + H and K1 + H of graphs are characterized and their corresponding weakly connected 2-domination numbers are obtained. The necessary and sufficient conditions for the join of graphs to have weakly connected 2-domination numbers equal to 2,3 and 4 are provided. Mathematics Subject Classification: 05C69","PeriodicalId":49860,"journal":{"name":"Mathematical Models & Methods in Applied Sciences","volume":"64 1","pages":""},"PeriodicalIF":3.6000,"publicationDate":"2022-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Weakly connected 2-domination in the join of graphs\",\"authors\":\"Mae P. Militante, R. G. Eballe, Rene E. Leonida\",\"doi\":\"10.12988/ams.2021.914589\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A weakly connected 2-dominating set of a connected graph G is a set D ⊆ V (G) such that every vertex in V (G)\\\\D is adjacent to at least two vertices in D and the subgraph, 〈D〉w, weakly induced by D is connected. In this paper, the weakly connected 2-dominating sets in the join G + H and K1 + H of graphs are characterized and their corresponding weakly connected 2-domination numbers are obtained. The necessary and sufficient conditions for the join of graphs to have weakly connected 2-domination numbers equal to 2,3 and 4 are provided. Mathematics Subject Classification: 05C69\",\"PeriodicalId\":49860,\"journal\":{\"name\":\"Mathematical Models & Methods in Applied Sciences\",\"volume\":\"64 1\",\"pages\":\"\"},\"PeriodicalIF\":3.6000,\"publicationDate\":\"2022-11-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematical Models & Methods in Applied Sciences\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.12988/ams.2021.914589\",\"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.2021.914589","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}

引用次数: 6

摘要

连通图G的弱连通2-支配集是一个集D≠V (G)，其中V (G)\D中的每个顶点与D中的至少两个顶点相邻，且由D弱诱导的子图< D > w是连通的。本文对图的连接G + H和K1 + H中的弱连通2-控制集进行了刻画，得到了它们对应的弱连通2-控制数。给出了图的连接具有弱连通2-控制数等于2、3、4的充分必要条件。数学学科分类:05C69

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

查看原文本刊更多论文

Weakly connected 2-domination in the join of graphs

A weakly connected 2-dominating set of a connected graph G is a set D ⊆ V (G) such that every vertex in V (G)\D is adjacent to at least two vertices in D and the subgraph, 〈D〉w, weakly induced by D is connected. In this paper, the weakly connected 2-dominating sets in the join G + H and K1 + H of graphs are characterized and their corresponding weakly connected 2-domination numbers are obtained. The necessary and sufficient conditions for the join of graphs to have weakly connected 2-domination numbers equal to 2,3 and 4 are provided. Mathematics Subject Classification: 05C69

求助全文

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

来源期刊

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.