Abstract:Given two disjoint vertex-sets, S = {s1,. .. , s k } and T = {t1,. .. , t k } in a graph, a paired many-to-many k-disjoint path cover joining S and T is a set of pairwise vertex-disjoint paths {P1,. .. , P k } that altogether cover every vertex of the graph, in which each path Pi runs from si to ti. In this paper, we first study the disjoint-path-cover properties of a bipartite cylindrical grid. Based on the findings, we prove that every bipartite toroidal grid, excluding the smallest one, has a paired many-to… Show more
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.