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

Discrete Mathematics Algorithms and Applications最新文献

筛选
英文 中文
Algebraic connectivity of Kronecker products of line graphs 线形图的Kronecker积的代数连通性
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2023-08-11 DOI: 10.1142/s1793830923500751
Shivani Chauhan, A. Satyanarayana Reddy
{"title":"Algebraic connectivity of Kronecker products of line graphs","authors":"Shivani Chauhan, A. Satyanarayana Reddy","doi":"10.1142/s1793830923500751","DOIUrl":"https://doi.org/10.1142/s1793830923500751","url":null,"abstract":"Let $X$ be a tree with $n$ vertices and $L(X)$ be its line graph. In this work, we completely characterize the trees for which the algebraic connectivity of $L(X)times K_m$ is equal to $m-1$, where $times$ denotes the Kronecker product. We provide a few necessary and sufficient conditions for $L(X)times K_m$ to be Laplacian integral. The algebraic connectivity of $L(X)times K_m$, where $X$ is a tree of diameter $4$ and $k$-book graph is discussed.","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"24 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2023-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78708511","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
Locating fair domination in graphs 在图中定位公平支配
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2023-08-10 DOI: 10.1142/s1793830923500696
V. Swaminathan, R. Sundareswaran, L. Muthusubramanian
{"title":"Locating fair domination in graphs","authors":"V. Swaminathan, R. Sundareswaran, L. Muthusubramanian","doi":"10.1142/s1793830923500696","DOIUrl":"https://doi.org/10.1142/s1793830923500696","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"106 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80922429","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
Codes arising from directed strongly regular graphs with μ = 1 由μ = 1的有向强正则图产生的码
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2023-08-04 DOI: 10.1142/s1793830923500660
M. Huilgol, Grace Divya D'Souza
{"title":"Codes arising from directed strongly regular graphs with μ = 1","authors":"M. Huilgol, Grace Divya D'Souza","doi":"10.1142/s1793830923500660","DOIUrl":"https://doi.org/10.1142/s1793830923500660","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"12 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2023-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81860045","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
Stability of Certified Domination upon Edge Addition 边加法上认证支配的稳定性
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2023-08-04 DOI: 10.1142/s1793830923500684
P. R. L. Pushpam, M. Kamalam, B. Mahavir
{"title":"Stability of Certified Domination upon Edge Addition","authors":"P. R. L. Pushpam, M. Kamalam, B. Mahavir","doi":"10.1142/s1793830923500684","DOIUrl":"https://doi.org/10.1142/s1793830923500684","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"27 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2023-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78584828","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
Padmakar-Ivan Index of Some Families of Graphs 若干图族的Padmakar-Ivan索引
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2023-07-28 DOI: 10.1142/s1793830923500647
T. Kavaskar, K. Vinothkumar
{"title":"Padmakar-Ivan Index of Some Families of Graphs","authors":"T. Kavaskar, K. Vinothkumar","doi":"10.1142/s1793830923500647","DOIUrl":"https://doi.org/10.1142/s1793830923500647","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"44 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2023-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84684922","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
4-Total domination game critical graphs 4 .总统治游戏关键图表
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2023-07-19 DOI: 10.1142/s1793830923500611
Chalermpong Worawannotai, Karnchana Charoensitthichai
{"title":"4-Total domination game critical graphs","authors":"Chalermpong Worawannotai, Karnchana Charoensitthichai","doi":"10.1142/s1793830923500611","DOIUrl":"https://doi.org/10.1142/s1793830923500611","url":null,"abstract":"The total domination game is played on a simple graph [Formula: see text] with no isolated vertices by two players, Dominator and Staller, who alternate choosing a vertex in [Formula: see text]. Each chosen vertex totally dominates its neighbors. In this game, each chosen vertex must totally dominates at least one new vertex not totally dominated before. The game ends when all vertices in [Formula: see text] are totally dominated. Dominator’s goal is to finish the game as soon as possible, and Staller’s goal is to prolong it as much as possible. The game total domination number is the number of chosen vertices when both players play optimally, denoted by [Formula: see text] when Dominator starts the game and denoted by [Formula: see text] when Staller starts the game. If a vertex [Formula: see text] in [Formula: see text] is declared to be already totally dominated, then we denote this graph by [Formula: see text]. A total domination game critical graph is a graph [Formula: see text] for which [Formula: see text] holds for every vertex [Formula: see text] in [Formula: see text]. If [Formula: see text], then [Formula: see text] is called [Formula: see text]-[Formula: see text]-critical. In this work, we characterize some 4-[Formula: see text]-critical graphs.","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"33 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2023-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87865777","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 strict-double-bound graphs and Cartesian products of paths and cycles 关于严格双界图和路径与环的笛卡尔积
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2023-07-17 DOI: 10.1142/s1793830923500581
Y. Egawa, Kenjiro Ogawa, K. Ozeki, Satoshi Tagusari, M. Tsuchiya
{"title":"On strict-double-bound graphs and Cartesian products of paths and cycles","authors":"Y. Egawa, Kenjiro Ogawa, K. Ozeki, Satoshi Tagusari, M. Tsuchiya","doi":"10.1142/s1793830923500581","DOIUrl":"https://doi.org/10.1142/s1793830923500581","url":null,"abstract":"For a poset [Formula: see text] the strict-double-bound graph ([Formula: see text]) of [Formula: see text] is the graph with the vertex set [Formula: see text] such that [Formula: see text] if and only if [Formula: see text] and there exist [Formula: see text] and [Formula: see text] distinct from [Formula: see text] and [Formula: see text] such that [Formula: see text] and [Formula: see text] For a connected graph [Formula: see text], the strict-double-bound number [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the graph with [Formula: see text] vertices and no edges. In this paper we deal with the strict-double-bound numbers of Cartesian products of graphs. We show that [Formula: see text] for [Formula: see text], [Formula: see text] for [Formula: see text], and [Formula: see text] for [Formula: see text].","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"36 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2023-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87307732","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
Enhanced Power Graphs of Certain Non-Abelian Groups 某些非阿贝尔群的增强幂图
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2023-07-13 DOI: 10.1142/s1793830923500635
Parveen, Sandeep Dalal, J. Kumar
{"title":"Enhanced Power Graphs of Certain Non-Abelian Groups","authors":"Parveen, Sandeep Dalal, J. Kumar","doi":"10.1142/s1793830923500635","DOIUrl":"https://doi.org/10.1142/s1793830923500635","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"47 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2023-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78399030","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
Domination-related parameters in middle graphs 中间图中与支配相关的参数
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2023-07-12 DOI: 10.1142/s179383092350060x
Kijung Kim
{"title":"Domination-related parameters in middle graphs","authors":"Kijung Kim","doi":"10.1142/s179383092350060x","DOIUrl":"https://doi.org/10.1142/s179383092350060x","url":null,"abstract":"The middle graph [Formula: see text] of a graph [Formula: see text] is the graph obtained by subdividing each edge of [Formula: see text] exactly once and joining all these newly introduced vertices of adjacent edges of [Formula: see text]. It is known that the decision problems for Italian domination number [Formula: see text], [Formula: see text]-rainbow domination number [Formula: see text] and Roman domination number [Formula: see text] are NP-complete. Recently, it was proved that [Formula: see text] for a graph [Formula: see text] of order [Formula: see text]. In this paper, we continue to study several domination and domatic numbers in middle graphs. We also obtain closed formulas for domination, secure domination and total domination numbers in middle graphs of rooted product graphs.","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"42 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2023-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75820469","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}
引用次数: 1
Author index Volume 15 (2023) 作者索引卷15 (2023)
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2023-06-30 DOI: 10.1142/s179383092399001x
{"title":"Author index Volume 15 (2023)","authors":"","doi":"10.1142/s179383092399001x","DOIUrl":"https://doi.org/10.1142/s179383092399001x","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"35 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2023-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88315614","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学术官方微信