7 research outputs found
On non-traceable, non-hypotraceable, arachnoid graphs
Motivated by questions concerning optical networks, in 2003 Gargano, Hammar, Hell, Stacho, and Vaccaro defined the notions of spanning spiders and arachnoid graphs. A spider is a tree with at most one branch (vertex of degree at least 3). The spider is centred at the branch vertex (if there is any,otherwise it is centred at any of the vertices). A graph is arachnoid if it has
a spanning spider centred at any of its vertices. Traceable graphs are obviously arachnoid, and Gargano et al. observed that hypotraceable graphs (non-traceable graphs with the property that all vertex-deleted subgraphs are
traceable) are also easily seen to be arachnoid. However, they did not find any other arachnoid graphs, and asked the question whether they exist. The main goal of this paper is to answer this question in the affirmative, moreover, we show that for any prescribed graph H, there exists a non-traceable, non-hypotraceable, arachnoid graph that contains H as an induced subgraph
Spanning spiders and light-splitting switches
AbstractMotivated by a problem in the design of optical networks, we ask when a graph has a spanning spider (subdivision of a star), or, more generally, a spanning tree with a bounded number of branch vertices. We investigate the existence of these spanning subgraphs in analogy to classical studies of Hamiltonicity
Spanning Trees with Bounded Number of Branch Vertices
We introduce the following combinatorial optimization problem: Given a connected graph G, find a spanning tree T of G with the smallest number of branchv ertices (vertices of degree 3 or more in T). The problem is motivated by new technologies in the realm of optical networks. We investigate algorithmic and combinatorial aspects of the problem