一些特殊图和图在某些操作下的$J$-全支配集的刻画

Javier Hassan, Jahiri Manditong, Alcyn Bakkang, Sisteta U. Kamdon, Jeffrey Imer Salim
{"title":"一些特殊图和图在某些操作下的$J$-全支配集的刻画","authors":"Javier Hassan, Jahiri Manditong, Alcyn Bakkang, Sisteta U. Kamdon, Jeffrey Imer Salim","doi":"10.29020/nybg.ejpam.v16i4.4912","DOIUrl":null,"url":null,"abstract":"Let G be a graph with no isolated vertex. A subset M ⊆ V (G) is called a J-open set if NG(a)\\NG(b) ̸= ∅ and NG(b)\\NG(a) ̸= ∅ ∀ a, b ∈ M, where a ̸= b. If in addition, M is a total dominating in G, then we call M a J-total dominating set in G. The maximum cardinality amongall J-total dominating set in G, denoted by γJt(G), is called the J-total domination number of G. In this paper, we characterize J-total dominating sets in some special graphs and join of two graphs, and we use these results to obtain formulas for the parameters of these graphs. Moreover, we determine its relationships with other known parameters in graph theory. Finally, we derive the lower bound of the parameter for the corona of two graphs.","PeriodicalId":51807,"journal":{"name":"European Journal of Pure and Applied Mathematics","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2023-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Characterizations of $J$-Total Dominating Sets in Some Special Graphs and Graphs under Some Operations\",\"authors\":\"Javier Hassan, Jahiri Manditong, Alcyn Bakkang, Sisteta U. Kamdon, Jeffrey Imer Salim\",\"doi\":\"10.29020/nybg.ejpam.v16i4.4912\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let G be a graph with no isolated vertex. A subset M ⊆ V (G) is called a J-open set if NG(a)\\\\NG(b) ̸= ∅ and NG(b)\\\\NG(a) ̸= ∅ ∀ a, b ∈ M, where a ̸= b. If in addition, M is a total dominating in G, then we call M a J-total dominating set in G. The maximum cardinality amongall J-total dominating set in G, denoted by γJt(G), is called the J-total domination number of G. In this paper, we characterize J-total dominating sets in some special graphs and join of two graphs, and we use these results to obtain formulas for the parameters of these graphs. Moreover, we determine its relationships with other known parameters in graph theory. Finally, we derive the lower bound of the parameter for the corona of two graphs.\",\"PeriodicalId\":51807,\"journal\":{\"name\":\"European Journal of Pure and Applied Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2023-10-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"European Journal of Pure and Applied Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.29020/nybg.ejpam.v16i4.4912\",\"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":"European Journal of Pure and Applied Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.29020/nybg.ejpam.v16i4.4912","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

设G是一个没有孤立顶点的图。M⊆V (G)的一个子集被称为J-open设置如果NG (A) (b) \ NG̸=∅和NG (A) (b) \ NG̸=∅∀A, b∈M,̸= b。如果此外,M是一个总主导G,然后调用M J-total支配集G的最大基数amongall J-total控制设置在G,用γJt (G),称为J-total统治的G .在本文中,我们描述J-total支配集在某些特殊图形和加入的两个图,我们利用这些结果得到了这些图的参数的公式。此外,我们还确定了它与图论中其他已知参数的关系。最后,我们导出了两个图的晕形参数的下界。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Characterizations of $J$-Total Dominating Sets in Some Special Graphs and Graphs under Some Operations
Let G be a graph with no isolated vertex. A subset M ⊆ V (G) is called a J-open set if NG(a)\NG(b) ̸= ∅ and NG(b)\NG(a) ̸= ∅ ∀ a, b ∈ M, where a ̸= b. If in addition, M is a total dominating in G, then we call M a J-total dominating set in G. The maximum cardinality amongall J-total dominating set in G, denoted by γJt(G), is called the J-total domination number of G. In this paper, we characterize J-total dominating sets in some special graphs and join of two graphs, and we use these results to obtain formulas for the parameters of these graphs. Moreover, we determine its relationships with other known parameters in graph theory. Finally, we derive the lower bound of the parameter for the corona of two graphs.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.30
自引率
28.60%
发文量
156
期刊最新文献
On Quasi Generalized Exchange Algebras On Quasi Generalized Exchange Algebras $J^2$-Independence Parameters of Some Graphs Spectral Analysis of Splitting Signed Graph Codimension One Foliation and the Prime Spectrum of a Ring
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1