Jelena DJoki'c, Ksenija Doroslovački, O. Bodroža-Pantić
{"title":"矩形、粗圆柱和莫比乌斯带网格图常见的二因子传递图的结构","authors":"Jelena DJoki'c, Ksenija Doroslovački, O. Bodroža-Pantić","doi":"10.2298/aadm211211006d","DOIUrl":null,"url":null,"abstract":"In this paper, we prove that all but one of the components of the transfer\n digraph D? m needed for the enumeration of 2-factors in the rectangular,\n thick cylinder and Moebius strip grid graphs of the fixed width m (m ? N)\n are bipartite digraphs and that their orders could be expressed in term of\n binomial coefficients. In addition, we prove that the set of vertices of\n each component consists of all the binary m-words for which the difference\n of numbers of zeros in odd and even positions is constant.","PeriodicalId":51232,"journal":{"name":"Applicable Analysis and Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"The structure of the 2-factor transfer digraph common for rectangular, thick cylinder and Moebius strip grid graphs\",\"authors\":\"Jelena DJoki'c, Ksenija Doroslovački, O. Bodroža-Pantić\",\"doi\":\"10.2298/aadm211211006d\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we prove that all but one of the components of the transfer\\n digraph D? m needed for the enumeration of 2-factors in the rectangular,\\n thick cylinder and Moebius strip grid graphs of the fixed width m (m ? N)\\n are bipartite digraphs and that their orders could be expressed in term of\\n binomial coefficients. In addition, we prove that the set of vertices of\\n each component consists of all the binary m-words for which the difference\\n of numbers of zeros in odd and even positions is constant.\",\"PeriodicalId\":51232,\"journal\":{\"name\":\"Applicable Analysis and Discrete Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2022-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applicable Analysis and Discrete Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.2298/aadm211211006d\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applicable Analysis and Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.2298/aadm211211006d","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
The structure of the 2-factor transfer digraph common for rectangular, thick cylinder and Moebius strip grid graphs
In this paper, we prove that all but one of the components of the transfer
digraph D? m needed for the enumeration of 2-factors in the rectangular,
thick cylinder and Moebius strip grid graphs of the fixed width m (m ? N)
are bipartite digraphs and that their orders could be expressed in term of
binomial coefficients. In addition, we prove that the set of vertices of
each component consists of all the binary m-words for which the difference
of numbers of zeros in odd and even positions is constant.
期刊介绍:
Applicable Analysis and Discrete Mathematics is indexed, abstracted and cover-to cover reviewed in: Web of Science, Current Contents/Physical, Chemical & Earth Sciences (CC/PC&ES), Mathematical Reviews/MathSciNet, Zentralblatt für Mathematik, Referativny Zhurnal-VINITI. It is included Citation Index-Expanded (SCIE), ISI Alerting Service and in Digital Mathematical Registry of American Mathematical Society (http://www.ams.org/dmr/).