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

Discrete Mathematics Algorithms and Applications最新文献

筛选
英文 中文
On (a, d)–Total Edge Irregular Labelings 在(a, d) -总边缘不规则标签
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2023-01-20 DOI: 10.1142/s1793830923500106
Sarbari Mitra, Soumya Bhoumik
{"title":"On (a, d)–Total Edge Irregular Labelings","authors":"Sarbari Mitra, Soumya Bhoumik","doi":"10.1142/s1793830923500106","DOIUrl":"https://doi.org/10.1142/s1793830923500106","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"176 1 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2023-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72522965","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
Solving the b-coloring problem for subdivision-edge neighbourhood coronas 求解细分边缘邻域日冕的b-着色问题
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2023-01-20 DOI: 10.1142/s179383092350009x
Raúl M. Falcón, M. Venkatachalam, S. J. Margaret
{"title":"Solving the b-coloring problem for subdivision-edge neighbourhood coronas","authors":"Raúl M. Falcón, M. Venkatachalam, S. J. Margaret","doi":"10.1142/s179383092350009x","DOIUrl":"https://doi.org/10.1142/s179383092350009x","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"23 17 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2023-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82943300","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
Line graphs associated to Von Neumann regular graphs of rings 与环的冯·诺依曼正则图相关的线形图
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2023-01-20 DOI: 10.1142/s1793830923500088
L. Boro, M. Singh
{"title":"Line graphs associated to Von Neumann regular graphs of rings","authors":"L. Boro, M. Singh","doi":"10.1142/s1793830923500088","DOIUrl":"https://doi.org/10.1142/s1793830923500088","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"1 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2023-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79646042","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 power graph of a monogenic semigroup 在单基因半群的幂图上
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2022-12-30 DOI: 10.1142/s1793830923500052
Biswaranjan Khanra, M. Mandal, Buddha Dev Ghosh
{"title":"On the power graph of a monogenic semigroup","authors":"Biswaranjan Khanra, M. Mandal, Buddha Dev Ghosh","doi":"10.1142/s1793830923500052","DOIUrl":"https://doi.org/10.1142/s1793830923500052","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"19 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2022-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82388738","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 2-degenerate graph embeddings 强2-退化图嵌入
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2022-12-30 DOI: 10.1142/s1793830923500076
Peng Ying, Xia Zhang
{"title":"Strong 2-degenerate graph embeddings","authors":"Peng Ying, Xia Zhang","doi":"10.1142/s1793830923500076","DOIUrl":"https://doi.org/10.1142/s1793830923500076","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"262 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2022-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74520374","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 a generalization of roman domination with more legions 用更多的军团来扩大罗马的统治
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2022-12-17 DOI: 10.1142/s1793830923500040
Fahimeh Khosh-Ahang Ghasr
{"title":"On a generalization of roman domination with more legions","authors":"Fahimeh Khosh-Ahang Ghasr","doi":"10.1142/s1793830923500040","DOIUrl":"https://doi.org/10.1142/s1793830923500040","url":null,"abstract":"In this note, we generalize the concepts of (perfect) Roman and Italian dominations to (perfect) strong Roman and Roman k-domination for arbitrary positive integer k. These generalizations cover some of previous ones. After some comparison of their domination numbers, as a first study of these concepts, we study the (perfect, strong, perfect strong) Roman k-domination numbers of complete bipartite graphs.","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"35 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2022-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78014580","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
Injective edge chromatic index of generalized Petersen graph P(ck,k) 广义Petersen图P(ck,k)的内射边色指数
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2022-12-01 DOI: 10.1142/s1793830922501890
Xiaolan Hu, Belayneh-Mengistu Legass
{"title":"Injective edge chromatic index of generalized Petersen graph P(ck,k)","authors":"Xiaolan Hu, Belayneh-Mengistu Legass","doi":"10.1142/s1793830922501890","DOIUrl":"https://doi.org/10.1142/s1793830922501890","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"87 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87693525","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
Author index Volume 14 (2022) 作者索引第14卷(2022年)
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2022-11-01 DOI: 10.1142/s1793830922990014
{"title":"Author index Volume 14 (2022)","authors":"","doi":"10.1142/s1793830922990014","DOIUrl":"https://doi.org/10.1142/s1793830922990014","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"29 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86036145","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
Euler Numbers and Diametral Paths in Fibonacci Cubes, Lucas Cubes and Alternate Lucas Cubes 斐波那契立方体、卢卡斯立方体和交替卢卡斯立方体中的欧拉数和直径路径
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2022-10-25 DOI: 10.1142/s1793830923500271
O. Egecioglu, Elif Saygı, Zülfükar Saygı
{"title":"Euler Numbers and Diametral Paths in Fibonacci Cubes, Lucas Cubes and Alternate Lucas Cubes","authors":"O. Egecioglu, Elif Saygı, Zülfükar Saygı","doi":"10.1142/s1793830923500271","DOIUrl":"https://doi.org/10.1142/s1793830923500271","url":null,"abstract":"The diameter of a graph is the maximum distance between pairs of vertices in the graph. A pair of vertices whose distance is equal to its diameter are called diametrically opposite vertices. The collection of shortest paths between diametrically opposite vertices are referred as diametral paths. In this work, we enumerate the number of diametral paths for Fibonacci cubes, Lucas cubes and Alternate Lucas cubes. We present bijective proofs that show that these numbers are related to alternating permutations and are enumerated by Euler numbers.","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"87 11 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2022-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87688743","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
Optimal Strategies for Static Black-Peg AB Game with Two and Three Pegs 静态二、三钉黑钉AB博弈的最优策略
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2022-10-10 DOI: 10.1142/s1793830923500490
Gerold Jager, F. Drewes
{"title":"Optimal Strategies for Static Black-Peg AB Game with Two and Three Pegs","authors":"Gerold Jager, F. Drewes","doi":"10.1142/s1793830923500490","DOIUrl":"https://doi.org/10.1142/s1793830923500490","url":null,"abstract":"The AB~Game is a game similar to the popular game Mastermind. We study a version of this game called Static Black-Peg AB~Game. It is played by two players, the codemaker and the codebreaker. The codemaker creates a so-called secret by placing a color from a set of $c$ colors on each of $p le c$ pegs, subject to the condition that every color is used at most once. The codebreaker tries to determine the secret by asking questions, where all questions are given at once and each question is a possible secret. As an answer the codemaker reveals the number of correctly placed colors for each of the questions. After that, the codebreaker only has one more try to determine the secret and thus to win the game. For given $p$ and $c$, our goal is to find the smallest number $k$ of questions the codebreaker needs to win, regardless of the secret, and the corresponding list of questions, called a $(k+1)$-strategy. We present a $lceil 4c/3 rceil-1)$-strategy for $p=2$ for all $c ge 2$, and a $lfloor (3c-1)/2 rfloor$-strategy for $p=3$ for all $c ge 4$ and show the optimality of both strategies, i.e., we prove that no $(k+1)$-strategy for a smaller $k$ exists.","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"17 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2022-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81651025","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学术官方微信