Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.endm.2015.06.084 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
spanning spider,arachnoid graph,spanning tree,hamiltonian path,hypotraceable graph | Discrete mathematics,Combinatorics,Indifference graph,Forbidden graph characterization,Chordal graph,Cograph,Pathwidth,Symmetric graph,1-planar graph,Mathematics,Split graph | Journal |
Volume | ISSN | Citations |
49 | 1571-0653 | 1 |
PageRank | References | Authors |
0.36 | 5 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gábor Wiener | 1 | 64 | 10.65 |