Pub Date : 2022-10-07DOI: 10.1142/s1793830923500659
Yi-Zheng Fan, Jian Zheng, Ya Yang
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$.
{"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}
Pub Date : 2022-09-16DOI: 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}
Pub Date : 2022-09-16DOI: 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}
Pub Date : 2022-09-16DOI: 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}
Pub Date : 2022-09-16DOI: 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}
Pub Date : 2022-09-16DOI: 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}
Pub Date : 2022-09-16DOI: 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}
Pub Date : 2022-09-15DOI: 10.1142/s179383092250149x
B. Rega, C. Durairajan
Separating codes have been studied due to their applications to digital finger printing, the state assignments, automata theory and to construct hash functions. In this paper, we study the necessary and sufficient conditions for a code to be a [Formula: see text] and [Formula: see text]-separating systems for q-ary level and also satisfy its intersecting properties. We also construct a bound for [Formula: see text] separating system.
{"title":"A note on (3,1) and (3,2) separating systems and bound for (3,1) separating system","authors":"B. Rega, C. Durairajan","doi":"10.1142/s179383092250149x","DOIUrl":"https://doi.org/10.1142/s179383092250149x","url":null,"abstract":"Separating codes have been studied due to their applications to digital finger printing, the state assignments, automata theory and to construct hash functions. In this paper, we study the necessary and sufficient conditions for a code to be a [Formula: see text] and [Formula: see text]-separating systems for q-ary level and also satisfy its intersecting properties. We also construct a bound for [Formula: see text] separating system.","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"96 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2022-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83370322","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：