{"title":"Co-normal Products and Modular Products of Soft Graphs","authors":"Bobin George, Jinta Jose, Rajesh K. Thumbakara","doi":"10.1142/s179383092350012x","DOIUrl":"https://doi.org/10.1142/s179383092350012x","url":null,"abstract":"","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"9 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2023-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77236983","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}
{"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}
{"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}
{"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}
{"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}
{"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}