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

Discrete Mathematics Algorithms and Applications最新文献

筛选
英文 中文
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
The trace of uniform hypergraphs with application to Estrada index 一致超图的迹及其在Estrada索引上的应用
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2022-10-07 DOI: 10.1142/s1793830923500659
Yi-Zheng Fan, Jian Zheng, Ya Yang
{"title":"The trace of uniform hypergraphs with application to Estrada index","authors":"Yi-Zheng Fan, Jian Zheng, Ya Yang","doi":"10.1142/s1793830923500659","DOIUrl":"https://doi.org/10.1142/s1793830923500659","url":null,"abstract":"In this paper we investigate the traces of the adjacency tensor of hypergraphs (simply called the traces of hypergraphs). We give new expressions for the traces of hypertrees and linear unicyclic hypergraphs by the weight function assigned to their connected sub-hypergraphs, and provide some perturbation results for the traces of a hypergraph with cut vertices. As applications we determine the unique hypertree with maximum Estrada index among all hypertrees with fixed number of edges and perfect matchings, and the unique unicyclic hypergraph with maximum Estrada index among all unicyclic hypergraph with fixed number of edges and girth $3$.","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"92 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2022-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73454092","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
Path partition of planar graphs with girth at least 6 周长至少为6的平面图的路径划分
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2022-09-16 DOI: 10.1142/s1793830922501580
Xiaoling Liu, Lei Sun, Wei Zheng
{"title":"Path partition of planar graphs with girth at least 6","authors":"Xiaoling Liu, Lei Sun, Wei Zheng","doi":"10.1142/s1793830922501580","DOIUrl":"https://doi.org/10.1142/s1793830922501580","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"48 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2022-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73899535","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
Partially balanced incomplete block (pbib)-designs arising from diametral paths in some strongly regular graphs 部分平衡不完全块(pbib)-由某些强正则图的直径路径引起的设计
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2022-09-16 DOI: 10.1142/s1793830922501634
M. Huilgol, M. Vidya
{"title":"Partially balanced incomplete block (pbib)-designs arising from diametral paths in some strongly regular graphs","authors":"M. Huilgol, M. Vidya","doi":"10.1142/s1793830922501634","DOIUrl":"https://doi.org/10.1142/s1793830922501634","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"26 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2022-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77653087","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
Enumeration of maximum matchings in the Hanoi graphs using matching polynomials 利用匹配多项式枚举河内图中的最大匹配
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2022-09-16 DOI: 10.1142/s1793830922501609
Zana Kovijanic Vukicevic
{"title":"Enumeration of maximum matchings in the Hanoi graphs using matching polynomials","authors":"Zana Kovijanic Vukicevic","doi":"10.1142/s1793830922501609","DOIUrl":"https://doi.org/10.1142/s1793830922501609","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"51 26","pages":""},"PeriodicalIF":1.2,"publicationDate":"2022-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72445972","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
Bounds on the Steiner radius of a graph 图的斯坦纳半径上的界
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2022-09-16 DOI: 10.1142/s1793830922501592
P. Ali, E. Baskoro
{"title":"Bounds on the Steiner radius of a graph","authors":"P. Ali, E. Baskoro","doi":"10.1142/s1793830922501592","DOIUrl":"https://doi.org/10.1142/s1793830922501592","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"129 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2022-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89892679","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
The fresh-graph of a nominal set 标称集合的新图
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2022-09-16 DOI: 10.1142/s1793830922501610
H. Pasbani, M. Haddadi
{"title":"The fresh-graph of a nominal set","authors":"H. Pasbani, M. Haddadi","doi":"10.1142/s1793830922501610","DOIUrl":"https://doi.org/10.1142/s1793830922501610","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"24 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2022-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89104052","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
Optimization of urban transport; an alternative to checkerboard towns plans 城市交通优化;棋盘式城镇规划的替代方案
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2022-09-16 DOI: 10.1142/s1793830922501567
Eymard Hernández-López, Giovanni Wences
{"title":"Optimization of urban transport; an alternative to checkerboard towns plans","authors":"Eymard Hernández-López, Giovanni Wences","doi":"10.1142/s1793830922501567","DOIUrl":"https://doi.org/10.1142/s1793830922501567","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"52 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2022-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90837827","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
Fault-Tolerant Strong Metric Dimension of Graphs 图的强度量维容错
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2022-09-16 DOI: 10.1142/s1793830922501622
Sathish Krishnan, Bharati Rajan
{"title":"Fault-Tolerant Strong Metric Dimension of Graphs","authors":"Sathish Krishnan, Bharati Rajan","doi":"10.1142/s1793830922501622","DOIUrl":"https://doi.org/10.1142/s1793830922501622","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"35 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2022-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85233232","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
Reversible complement cyclic codes over ℤ4 + uℤ4 + vℤ4 for DNA computing 用于DNA计算的可逆补循环码
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2022-09-16 DOI: 10.1142/s1793830922501579
C. Klin-eam, Wateekorn Sriwirach
{"title":"Reversible complement cyclic codes over ℤ4 + uℤ4 + vℤ4 for DNA computing","authors":"C. Klin-eam, Wateekorn Sriwirach","doi":"10.1142/s1793830922501579","DOIUrl":"https://doi.org/10.1142/s1793830922501579","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"34 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2022-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76204421","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学术官方微信
小红书