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

Discrete Mathematics Algorithms and Applications最新文献

筛选
英文 中文
Unique fault-tolerance resolvability codes for certain generalized convex polytopes with applications 一类广义凸多面体的唯一容错可解析性编码及其应用
Discrete Mathematics Algorithms and Applications Pub Date : 2024-12-27 DOI: 10.1142/s1793830925500132
Gayathri Manikonda, Vijay Kumar Bhat, Sunny Kumar Sharma
{"title":"Unique fault-tolerance resolvability codes for certain generalized convex polytopes with applications","authors":"Gayathri Manikonda, Vijay Kumar Bhat, Sunny Kumar Sharma","doi":"10.1142/s1793830925500132","DOIUrl":"https://doi.org/10.1142/s1793830925500132","url":null,"abstract":"For a non-trivial connected graph [Formula: see text], an ordered subset [Formula: see text] of vertices [Formula: see text] any pair of different vertices [Formula: see text], if [Formula: see text] for some [Formula: see text]. Such a set [Formula: see text] is said to be a resolving set (RS) for [Formula: see text] and the smallest cardinality of [Formula: see text] is called the [Formula: see text] [Formula: see text] of [Formula: see text]. A RS [Formula: see text] for [Formula: see text] is said to be fault-tolerant resolving set (FTRS) if the property of resolving [Formula: see text] holds by [Formula: see text] for every [Formula: see text] in [Formula: see text]. The minimum cardinality of such a set [Formula: see text] is called the fault-tolerant metric dimension (FTMD) of [Formula: see text]. It is generally denoted by [Formula: see text]. In this paper, the notion of FTRS and that of FTMD have been determined for two complex families of infinite convex polytope graphs, which are obtained by joining certain copies of the prism graph together with an antiprism graph. For these two families of planar graph (viz., [Formula: see text] & [Formula: see text]), we investigate several properties as well as we compare their metric and FTMD.","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"18 01","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147901433","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
Total Chromatic Number for Certain Classes of Product Graphs 一类积图的全色数
Discrete Mathematics Algorithms and Applications Pub Date : 2023-11-10 DOI: 10.1142/s1793830923500994
T. P. Sandhiya, J. Geetha, K. Somasundaram
{"title":"Total Chromatic Number for Certain Classes of Product Graphs","authors":"T. P. Sandhiya, J. Geetha, K. Somasundaram","doi":"10.1142/s1793830923500994","DOIUrl":"https://doi.org/10.1142/s1793830923500994","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":" 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135191288","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
Surveying the Landscape of Text Summarization with Deep Learning: A Comprehensive Review 基于深度学习的文本摘要研究综述
Discrete Mathematics Algorithms and Applications Pub Date : 2023-11-10 DOI: 10.1142/s1793830923300047
Guanghua Wang, Weili Wu
{"title":"Surveying the Landscape of Text Summarization with Deep Learning: A Comprehensive Review","authors":"Guanghua Wang, Weili Wu","doi":"10.1142/s1793830923300047","DOIUrl":"https://doi.org/10.1142/s1793830923300047","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":" June","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135186019","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
Strong Nonsplit domsaturation number of a graph 图的强非分裂饱和数
Discrete Mathematics Algorithms and Applications Pub Date : 2023-11-04 DOI: 10.1142/s1793830923500891
Y. Therese Sunitha Mary, R. Kala
{"title":"Strong Nonsplit domsaturation number of a graph","authors":"Y. Therese Sunitha Mary, R. Kala","doi":"10.1142/s1793830923500891","DOIUrl":"https://doi.org/10.1142/s1793830923500891","url":null,"abstract":"The strong nonsplit domsaturation number of a graph [Formula: see text], [Formula: see text] is the least positive integer [Formula: see text] such that every vertex of [Formula: see text] lies in a strong nonsplit dominating set of cardinality [Formula: see text]. In this paper, we obtain certain bounds for [Formula: see text] and characterize the graphs which attain these bounds.","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"14 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135728299","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
Some results on a supergraph of the sum annihilating ideal graph of a commutative ring 交换环的和湮灭理想图的超图的一些结果
Discrete Mathematics Algorithms and Applications Pub Date : 2023-11-02 DOI: 10.1142/s1793830923500878
S. Visweswaran
{"title":"Some results on a supergraph of the sum annihilating ideal graph of a commutative ring","authors":"S. Visweswaran","doi":"10.1142/s1793830923500878","DOIUrl":"https://doi.org/10.1142/s1793830923500878","url":null,"abstract":"The rings considered in this paper are commutative with identity which are not integral domains. Let [Formula: see text] be a ring. An ideal [Formula: see text] of [Formula: see text] is said to be an annihilating ideal if there exists [Formula: see text] such that [Formula: see text]. Let [Formula: see text] denote the set of all annihilating ideals of [Formula: see text] and we denote [Formula: see text] by [Formula: see text]. With [Formula: see text], in this paper, we associate an undirected graph denoted by [Formula: see text] whose vertex set is [Formula: see text] and two distinct vertices [Formula: see text] are adjacent in this graph if and only if either [Formula: see text] or [Formula: see text]. The aim of this paper is to study the interplay between some graph properties of [Formula: see text] and the algebraic properties of [Formula: see text] and to compare some graph properties of [Formula: see text] with the corresponding graph properties of the annihilating ideal graph of [Formula: see text] and the sum annihilating ideal graph of [Formula: see text].","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"64 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135874437","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 study of rainbow antimagic connection number of comb product of tree and complete bipartite graph 树与完全二部图梳积的彩虹反魔术连接数研究
Discrete Mathematics Algorithms and Applications Pub Date : 2023-11-01 DOI: 10.1142/s1793830923500982
B. J. Septory, L. Susilowati, None Dafik, M. Venkatachalam
{"title":"On the study of rainbow antimagic connection number of comb product of tree and complete bipartite graph","authors":"B. J. Septory, L. Susilowati, None Dafik, M. Venkatachalam","doi":"10.1142/s1793830923500982","DOIUrl":"https://doi.org/10.1142/s1793830923500982","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135216208","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
Achromatic Number of Some Classes of Digraphs 几类有向图的消色差数
Discrete Mathematics Algorithms and Applications Pub Date : 2023-10-31 DOI: 10.1142/s1793830923500908
S. M. Hegde, Lolita Priya Castelino
{"title":"Achromatic Number of Some Classes of Digraphs","authors":"S. M. Hegde, Lolita Priya Castelino","doi":"10.1142/s1793830923500908","DOIUrl":"https://doi.org/10.1142/s1793830923500908","url":null,"abstract":"Let [Formula: see text] be a directed graph with [Formula: see text] vertices and [Formula: see text] arcs. A function [Formula: see text] where [Formula: see text] is called a complete coloring of [Formula: see text] if and only if for every arc [Formula: see text] of [Formula: see text], the ordered pair [Formula: see text] appears at least once. If the pair [Formula: see text] is not assigned, then [Formula: see text] is called a [Formula: see text] [Formula: see text] [Formula: see text] of [Formula: see text]. The maximum [Formula: see text] for which [Formula: see text] admits a proper complete coloring is called the [Formula: see text] [Formula: see text] of [Formula: see text] and is denoted by [Formula: see text]. We obtain the upper bound for the achromatic number of digraphs and regular digraphs and investigate the same for some classes of digraphs such as unipath, unicycle, circulant digraphs, etc.","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"364 13","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135765192","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 perfect Italian domination in graphs 论意大利在图形上的完美统治
Discrete Mathematics Algorithms and Applications Pub Date : 2023-10-31 DOI: 10.1142/s1793830923500854
Leonard M. Paleta, Ferdinand P. Jamil
{"title":"On perfect Italian domination in graphs","authors":"Leonard M. Paleta, Ferdinand P. Jamil","doi":"10.1142/s1793830923500854","DOIUrl":"https://doi.org/10.1142/s1793830923500854","url":null,"abstract":"For a vertex [Formula: see text] in a simple, finite and undirected graph [Formula: see text], the neighborhood [Formula: see text] of [Formula: see text] is the set consisting of all vertices of [Formula: see text] which are adjacent to [Formula: see text]. A perfect Italian dominating function on [Formula: see text] is a function [Formula: see text] such that for each [Formula: see text] with [Formula: see text], [Formula: see text]. The weight of a perfect Italian dominating function [Formula: see text] is the value [Formula: see text]. The perfect Italian domination number of [Formula: see text] is the minimum weight of a perfect Italian dominating function on [Formula: see text]. In this paper, we study the perfect Italian domination in graphs under some binary operations.","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"34 31","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135765496","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
Approximation Algorithms for the Graph Burning on Cactus and Directed Trees 仙人掌和有向树图燃烧的近似算法
Discrete Mathematics Algorithms and Applications Pub Date : 2023-10-27 DOI: 10.1142/s1793830923500969
Rahul Kumar Gautam, Anjeneya Swami Kare, S. Durga Bhavani
{"title":"Approximation Algorithms for the Graph Burning on Cactus and Directed Trees","authors":"Rahul Kumar Gautam, Anjeneya Swami Kare, S. Durga Bhavani","doi":"10.1142/s1793830923500969","DOIUrl":"https://doi.org/10.1142/s1793830923500969","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136312432","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 Graceful Coloring of Generalized Petersen Graphs 关于广义Petersen图的优美着色
Discrete Mathematics Algorithms and Applications Pub Date : 2023-10-27 DOI: 10.1142/s1793830923500970
A. I. Kristiana, D. Setyawan, R. Alfarisi, R. M. Prihandini
{"title":"On Graceful Coloring of Generalized Petersen Graphs","authors":"A. I. Kristiana, D. Setyawan, R. Alfarisi, R. M. Prihandini","doi":"10.1142/s1793830923500970","DOIUrl":"https://doi.org/10.1142/s1793830923500970","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136312418","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学术文献互助群
群 号：604180095
Book学术官方微信
小红书