Pub Date : 2024-02-09DOI: 10.1142/s1793830924500046
P. Vijayalakshmi, K. Karuppasamy, Tiji Thomas
Let G be a graph with a set of V vertices and a set of E edges. A function [Formula: see text] is called a restrained dominating function (RDF) of G if, for every [Formula: see text] [Formula: see text]. A restrained dominating function f of a graph G is called minimal (MRDF) if, for all functions [Formula: see text] such that [Formula: see text] and g(v) [Formula: see text] f(v) for at least one [Formula: see text] g is not a RDF. The fractional restrained domination number [Formula: see text] is defined as follows: [Formula: see text]: f is an MRDF of G[Formula: see text] where [Formula: see text].
设 G 是一个有 V 个顶点和 E 条边的图。如果对于每个函数 [公式：见正文] [公式：见正文]，G 的一个函数 [公式：见正文] 称为限制支配函数 (RDF)。如果对于所有函数 [公式：见正文]，且 g(v) [公式：见正文] f(v) 至少有一个 [公式：见正文] g 不是 RDF，则图 G 的限制支配函数 f 称为最小值（MRDF）。小数约束支配数[式：见正文]定义如下：[公式：见正文]：f 是 G 的 MRDF[公式：见正文]，其中[公式：见正文]。
{"title":"Fractional restrained domination","authors":"P. Vijayalakshmi, K. Karuppasamy, Tiji Thomas","doi":"10.1142/s1793830924500046","DOIUrl":"https://doi.org/10.1142/s1793830924500046","url":null,"abstract":"Let G be a graph with a set of V vertices and a set of E edges. A function [Formula: see text] is called a restrained dominating function (RDF) of G if, for every [Formula: see text] [Formula: see text]. A restrained dominating function f of a graph G is called minimal (MRDF) if, for all functions [Formula: see text] such that [Formula: see text] and g(v) [Formula: see text] f(v) for at least one [Formula: see text] g is not a RDF. The fractional restrained domination number [Formula: see text] is defined as follows: [Formula: see text]: f is an MRDF of G[Formula: see text] where [Formula: see text].","PeriodicalId":504044,"journal":{"name":"Discrete Mathematics, Algorithms and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139848693","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-02-09DOI: 10.1142/s1793830924500046
P. Vijayalakshmi, K. Karuppasamy, Tiji Thomas
Let G be a graph with a set of V vertices and a set of E edges. A function [Formula: see text] is called a restrained dominating function (RDF) of G if, for every [Formula: see text] [Formula: see text]. A restrained dominating function f of a graph G is called minimal (MRDF) if, for all functions [Formula: see text] such that [Formula: see text] and g(v) [Formula: see text] f(v) for at least one [Formula: see text] g is not a RDF. The fractional restrained domination number [Formula: see text] is defined as follows: [Formula: see text]: f is an MRDF of G[Formula: see text] where [Formula: see text].
设 G 是一个有 V 个顶点和 E 条边的图。如果对于每个函数 [公式：见正文] [公式：见正文]，G 的一个函数 [公式：见正文] 称为限制支配函数 (RDF)。如果对于所有函数 [公式：见正文]，且 g(v) [公式：见正文] f(v) 至少有一个 [公式：见正文] g 不是 RDF，则图 G 的限制支配函数 f 称为最小值（MRDF）。小数约束支配数[式：见正文]定义如下：[公式：见正文]：f 是 G 的 MRDF[公式：见正文]，其中[公式：见正文]。
{"title":"Fractional restrained domination","authors":"P. Vijayalakshmi, K. Karuppasamy, Tiji Thomas","doi":"10.1142/s1793830924500046","DOIUrl":"https://doi.org/10.1142/s1793830924500046","url":null,"abstract":"Let G be a graph with a set of V vertices and a set of E edges. A function [Formula: see text] is called a restrained dominating function (RDF) of G if, for every [Formula: see text] [Formula: see text]. A restrained dominating function f of a graph G is called minimal (MRDF) if, for all functions [Formula: see text] such that [Formula: see text] and g(v) [Formula: see text] f(v) for at least one [Formula: see text] g is not a RDF. The fractional restrained domination number [Formula: see text] is defined as follows: [Formula: see text]: f is an MRDF of G[Formula: see text] where [Formula: see text].","PeriodicalId":504044,"journal":{"name":"Discrete Mathematics, Algorithms and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139788705","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-02-01DOI: 10.1142/s1793830924500162
Omendra Singh, Pravin Garg, Neha Kansal
{"title":"An Algorithm and Maximum Deficiency Energy of Some Graphs","authors":"Omendra Singh, Pravin Garg, Neha Kansal","doi":"10.1142/s1793830924500162","DOIUrl":"https://doi.org/10.1142/s1793830924500162","url":null,"abstract":"","PeriodicalId":504044,"journal":{"name":"Discrete Mathematics, Algorithms and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139872580","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-02-01DOI: 10.1142/s1793830924500162
Omendra Singh, Pravin Garg, Neha Kansal
{"title":"An Algorithm and Maximum Deficiency Energy of Some Graphs","authors":"Omendra Singh, Pravin Garg, Neha Kansal","doi":"10.1142/s1793830924500162","DOIUrl":"https://doi.org/10.1142/s1793830924500162","url":null,"abstract":"","PeriodicalId":504044,"journal":{"name":"Discrete Mathematics, Algorithms and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139812719","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-01-25DOI: 10.1142/s1793830924500113
N. J. Rad, R. Hasni, H. Kamarulhaili
{"title":"On the Harmonic index in Cactus graphs","authors":"N. J. Rad, R. Hasni, H. Kamarulhaili","doi":"10.1142/s1793830924500113","DOIUrl":"https://doi.org/10.1142/s1793830924500113","url":null,"abstract":"","PeriodicalId":504044,"journal":{"name":"Discrete Mathematics, Algorithms and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139595712","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-01-25DOI: 10.1142/s1793830924500137
K. Jeya Daisy, R. Santrin Sabibha, P. Jeyanthi, M. Youssef
{"title":"On Bijective Product Square K-Cordial Labeling","authors":"K. Jeya Daisy, R. Santrin Sabibha, P. Jeyanthi, M. Youssef","doi":"10.1142/s1793830924500137","DOIUrl":"https://doi.org/10.1142/s1793830924500137","url":null,"abstract":"","PeriodicalId":504044,"journal":{"name":"Discrete Mathematics, Algorithms and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139597969","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-01-25DOI: 10.1142/s1793830924500125
Mingyue Yang, Huijuan Wang
{"title":"List 2-distance Coloring for Planar Graphs with Short Circle Constraints","authors":"Mingyue Yang, Huijuan Wang","doi":"10.1142/s1793830924500125","DOIUrl":"https://doi.org/10.1142/s1793830924500125","url":null,"abstract":"","PeriodicalId":504044,"journal":{"name":"Discrete Mathematics, Algorithms and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140496136","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-01-25DOI: 10.1142/s1793830924500149
R. Sumathi, K. Angaleeswari, R. Sundareswaran, V. Swaminathan
{"title":"Maximal Point Set Domination in graphs","authors":"R. Sumathi, K. Angaleeswari, R. Sundareswaran, V. Swaminathan","doi":"10.1142/s1793830924500149","DOIUrl":"https://doi.org/10.1142/s1793830924500149","url":null,"abstract":"","PeriodicalId":504044,"journal":{"name":"Discrete Mathematics, Algorithms and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139597162","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-01-25DOI: 10.1142/s1793830924500150
N. Giftlin Kiruba, Y. Therese Sunitha Mary
{"title":"Roman Detour Domination Number of Generalized Hypercube Networks","authors":"N. Giftlin Kiruba, Y. Therese Sunitha Mary","doi":"10.1142/s1793830924500150","DOIUrl":"https://doi.org/10.1142/s1793830924500150","url":null,"abstract":"","PeriodicalId":504044,"journal":{"name":"Discrete Mathematics, Algorithms and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140495239","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-01-19DOI: 10.1142/s1793830924500083
Yu-Jie Cui, Aria Mingyue Zhu, Xin-Chun Zhan
{"title":"Independence polynomials of graphs with given cover number or dominate number","authors":"Yu-Jie Cui, Aria Mingyue Zhu, Xin-Chun Zhan","doi":"10.1142/s1793830924500083","DOIUrl":"https://doi.org/10.1142/s1793830924500083","url":null,"abstract":"","PeriodicalId":504044,"journal":{"name":"Discrete Mathematics, Algorithms and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139525474","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：