Name
Abstract | ||
|---|---|---|
Abstract Spiders are arthropods that can be distinguished from their closest relatives, the insects, by counting their legs. Spiders have eight, insects just six. Spider graphs are a very restricted class of graphs that naturally appear in the context of cograph editing. The vertex set of a spider (or its complement) is naturally partitioned into a clique (the body), an independent set (the legs), and a rest (serving as the head). Here we show that spiders can be recognized directly from their degree sequences through the number of their legs (vertices with degree 1). Furthermore, we completely characterize the degree sequences of spiders. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/s11786-015-0233-1 | Mathematics in Computer Science |
Keywords | Field | DocType |
Phylogenetics,Cograph,P4-sparse,Spider,Degree sequence,Primary 05C07,Secondary 05C75 | Discrete mathematics,Graph,Combinatorics,Closest relatives,Spider,Vertex (geometry),Clique,Independent set,Degree (graph theory),Cograph,Mathematics | Journal |
Volume | Issue | ISSN |
abs/1411.2105 | 4 | 1661-8270 |
Citations | PageRank | References |
1 | 0.49 | 7 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sarah Berkemer | 1 | 1 | 1.51 |
| Ricardo Régis Cavalcante Chaves | 2 | 1 | 0.49 |
| Adrian Fritz | 3 | 2 | 1.20 |
| marc hellmuth | 4 | 148 | 22.80 |
| Maribel Hernandez-Rosales | 5 | 47 | 3.44 |
| Peter F. Stadler | 6 | 1839 | 152.96 |