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

Discrete Mathematics Algorithms and Applications最新文献

筛选
英文 中文
Minimal Codewords: An Applications of Relative Four-Weight Codes 最小码字:相对四权码的一个应用
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2023-06-30 DOI: 10.1142/s1793830923500623
B. Rega, .. Ramesh Babu
{"title":"Minimal Codewords: An Applications of Relative Four-Weight Codes","authors":"B. Rega, .. Ramesh Babu","doi":"10.1142/s1793830923500623","DOIUrl":"https://doi.org/10.1142/s1793830923500623","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":" 20","pages":""},"PeriodicalIF":1.2,"publicationDate":"2023-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72383739","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
A constructive proof of the Fulkerson-Ryser characterization of digraphic sequences 有向序列的Fulkerson-Ryser刻划的建设性证明
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2023-05-23 DOI: 10.1142/s1793830923500568
A. Mukhopadhyay, Daniel John
{"title":"A constructive proof of the Fulkerson-Ryser characterization of digraphic sequences","authors":"A. Mukhopadhyay, Daniel John","doi":"10.1142/s1793830923500568","DOIUrl":"https://doi.org/10.1142/s1793830923500568","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"13 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2023-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87085550","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 Power-Generalized k – Horadam Sequences in Different Modules and A New Cryptographic Method with These Sequences 不同模上的幂广义k - Horadam序列及其一种新的密码方法
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2023-05-23 DOI: 10.1142/s1793830923500556
Cagla Celemoglu, A. Nalli
{"title":"The Power-Generalized k – Horadam Sequences in Different Modules and A New Cryptographic Method with These Sequences","authors":"Cagla Celemoglu, A. Nalli","doi":"10.1142/s1793830923500556","DOIUrl":"https://doi.org/10.1142/s1793830923500556","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"31 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2023-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91274617","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
Faster Optimal ate Pairings for Cyclotomic Sparse Families of Pairing-Friendly Elliptic Curves with Embedding Degrees k = 5,7 嵌入度k = 5,7的亲配对椭圆曲线分割稀疏族的快速最优配对
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2023-05-22 DOI: 10.1142/s1793830923500544
Senegue Gomez Nyamsi, Emmanuel Fouotsa, C. Tcheka
{"title":"Faster Optimal ate Pairings for Cyclotomic Sparse Families of Pairing-Friendly Elliptic Curves with Embedding Degrees k = 5,7","authors":"Senegue Gomez Nyamsi, Emmanuel Fouotsa, C. Tcheka","doi":"10.1142/s1793830923500544","DOIUrl":"https://doi.org/10.1142/s1793830923500544","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"108 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2023-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81738766","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 coloring of planar graphs with girth restriction 具有周长限制的平面图的内射边着色
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2023-05-19 DOI: 10.1142/s1793830923500507
Y. Bu, P. Wang, Hongguo Zhu
{"title":"Injective edge coloring of planar graphs with girth restriction","authors":"Y. Bu, P. Wang, Hongguo Zhu","doi":"10.1142/s1793830923500507","DOIUrl":"https://doi.org/10.1142/s1793830923500507","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"19 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2023-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78434963","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
Recommender Systems Based on Matrix Factorization and the Properties of Inferred Social Networks 基于矩阵分解和推断社会网络特性的推荐系统
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2023-05-19 DOI: 10.1142/s1793830923500520
Santiago Uribe Pastas, Carlos Ernesto Ramirez Ovalle, Jorge Finke Ortiz
{"title":"Recommender Systems Based on Matrix Factorization and the Properties of Inferred Social Networks","authors":"Santiago Uribe Pastas, Carlos Ernesto Ramirez Ovalle, Jorge Finke Ortiz","doi":"10.1142/s1793830923500520","DOIUrl":"https://doi.org/10.1142/s1793830923500520","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"6 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2023-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88277434","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 distance-s locating and distance-t dominating sets in graphs 图中距离-s定位和距离-t支配集
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2023-05-10 DOI: 10.1142/s1793830923500477
Eunjeong Yi
{"title":"On distance-s locating and distance-t dominating sets in graphs","authors":"Eunjeong Yi","doi":"10.1142/s1793830923500477","DOIUrl":"https://doi.org/10.1142/s1793830923500477","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"23 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2023-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86627950","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 New Results on Captive Dominating Sets in Graphs 图中控制集的一些新结果
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2023-05-10 DOI: 10.1142/s1793830923500489
S. Vaidya, H. Vadhel
{"title":"Some New Results on Captive Dominating Sets in Graphs","authors":"S. Vaidya, H. Vadhel","doi":"10.1142/s1793830923500489","DOIUrl":"https://doi.org/10.1142/s1793830923500489","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"19 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2023-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80080225","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
New bounds on the outer independent total double Roman domination number 新边界上的外独立总双罗马统治数
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2023-05-05 DOI: 10.1142/s179383092350043x
S. M. Sheikholeslami, L. Volkmann
{"title":"New bounds on the outer independent total double Roman domination number","authors":"S. M. Sheikholeslami, L. Volkmann","doi":"10.1142/s179383092350043x","DOIUrl":"https://doi.org/10.1142/s179383092350043x","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"33 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2023-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79488760","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
Detour Distance Laplacian Matrices for Signed Networks 签名网络的绕行距离拉普拉斯矩阵
IF 1.2
Discrete Mathematics Algorithms and Applications Pub Date : 2023-05-05 DOI: 10.1142/s1793830923500428
K. Biju, K. S. Shahul Hameed, Fouzul Atik
{"title":"Detour Distance Laplacian Matrices for Signed Networks","authors":"K. Biju, K. S. Shahul Hameed, Fouzul Atik","doi":"10.1142/s1793830923500428","DOIUrl":"https://doi.org/10.1142/s1793830923500428","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"21 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2023-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89381407","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学术官方微信