发布求助
文献互助 智能选刊 最新文献

Discrete Mathematics, Algorithms and Applications最新文献

筛选
英文 中文
Fractional restrained domination 零碎克制支配
Discrete Mathematics, Algorithms and Applications Pub Date : 2024-02-09 DOI: 10.1142/s1793830924500046
P. Vijayalakshmi, K. Karuppasamy, Tiji Thomas
{"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}
引用次数: 0
Fractional restrained domination 零碎克制支配
Discrete Mathematics, Algorithms and Applications Pub Date : 2024-02-09 DOI: 10.1142/s1793830924500046
P. Vijayalakshmi, K. Karuppasamy, Tiji Thomas
{"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}
引用次数: 0
An Algorithm and Maximum Deficiency Energy of Some Graphs 某些图的算法和最大缺陷能
Discrete Mathematics, Algorithms and Applications Pub Date : 2024-02-01 DOI: 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}
引用次数: 0
An Algorithm and Maximum Deficiency Energy of Some Graphs 某些图的算法和最大缺陷能
Discrete Mathematics, Algorithms and Applications Pub Date : 2024-02-01 DOI: 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}
引用次数: 0
On the Harmonic index in Cactus graphs 关于仙人掌图中的谐波指数
Discrete Mathematics, Algorithms and Applications Pub Date : 2024-01-25 DOI: 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}
引用次数: 0
On Bijective Product Square K-Cordial Labeling 关于双射积方形 K 键标签
Discrete Mathematics, Algorithms and Applications Pub Date : 2024-01-25 DOI: 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}
引用次数: 0
List 2-distance Coloring for Planar Graphs with Short Circle Constraints 带短圆约束的平面图的列表 2-距离着色
Discrete Mathematics, Algorithms and Applications Pub Date : 2024-01-25 DOI: 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}
引用次数: 0
Maximal Point Set Domination in graphs 图形中的最大点集支配
Discrete Mathematics, Algorithms and Applications Pub Date : 2024-01-25 DOI: 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}
引用次数: 0
Roman Detour Domination Number of Generalized Hypercube Networks 广义超立方网络的罗马迂回支配数
Discrete Mathematics, Algorithms and Applications Pub Date : 2024-01-25 DOI: 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}
引用次数: 0
Independence polynomials of graphs with given cover number or dominate number 具有给定覆盖数或支配数的图形的独立性多项式
Discrete Mathematics, Algorithms and Applications Pub Date : 2024-01-19 DOI: 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}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信