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.
| Original language | English |
|---|---|
| Pages (from-to) | 437-441 |
| Number of pages | 5 |
| Journal | Mathematics in Computer Science |
| Volume | 9 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 1 Dec 2015 |
| Externally published | Yes |
Keywords
- Cograph
- Degree sequence
- P4-sparse
- Phylogenetics
- Spider
Fingerprint
Dive into the research topics of 'Spiders can be Recognized by Counting Their Legs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver