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}
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.