On the relation between connectivity, independence and generalized caterpillars

arXiv1302.5038MaRDI QIDQ6239786FDOQ6239786

Authors: Mohammad Pedramfar, M. Shokrian, Mojtaba Tefagh 

Publication date: 20 February 2013

Abstract: A spanning generalized caterpillar is a spanning tree in which all vertices of degree more than two are on a path. In this note, we find a relation between the existence of spanning generalized caterpillar and the independence and connectivity number in a graph. We also point out to an error in a "theorem" in the paper "Spanning spiders and light-splitting switches", by L. Gargano et al. in Discrete Math. (2004), and find out a relation between another mentioned theorem and the existence of spanning generalized caterpillar.

This page was built for publication: On the relation between connectivity, independence and generalized caterpillars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6239786)