Partitioning the Cartesian product of a tree and a cycle

Fengxia Liu, Baoyindureng Wu and Jixiang Meng

Applied Mathematics and Computation, 2018, vol. 332, issue C, 90-95

Abstract: Let G=(V,E) be a graph of order n, and λ=(λ1,λ2,…,λp) a sequence of positive integers. The sequence λ is admissible for G if λ1+⋯+λp=n. Such an admissible sequence λ is said to be realizable in G if there exists a partition (V1,V2,…,Vp) of the vertex set V such that Vi induces a connected subgraph of order ni in G for each i. If every admissible sequence is realizable in G, then we say that G is arbitrarily partitionable (AP, for short). We show that if a tree T of maximum degree at most n+1 has a path containing all the vertices of degree n+1, then T□Cn has a Hamiltonian path. In particular, for any caterpillar T with maximum degree at most n+1,T□Cn is AP. In addition, if T is a caterpillar with Δ(T)≥n+4, then T□Cn is not AP. For the cases n+2≤Δ(T)≤n+3, we present some sufficient conditions for a caterpillar T such that T□Cn is AP.

Keywords: Arbitrarily partitionable graphs; Cartesian product of graphs; Caterpillars (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318301802
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:332:y:2018:i:c:p:90-95

DOI: 10.1016/j.amc.2018.03.015

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().