THE STRUCTURE OF THE 2-FACTOR TRANSFER DIGRAPH COMMON FOR RECTANGULAR, THICK CYLINDER AND MOEBIUS STRIP GRID GRAPHS

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 bi...

Full description

Saved in:
Bibliographic Details
Published in:Applicable analysis and discrete mathematics Vol. 17; no. 1; pp. 120 - 137
Main Authors: Djokic, Jelena, Doroslovacki, Ksenija, Bodroza-Pantic, Olga
Format: Journal Article
Language:English
Published: University of Belgrade, Serbia 01-04-2023
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1452-8630
2406-100X
DOI:10.2298/AADM211211006D