Pith. sign in

REVIEW

Spiders can be recognized by counting their legs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1411.2105 v1 pith:6E4K7GVW submitted 2014-11-08 cs.DM

classification cs.DM
keywords spiderslegsdegreecountinggraphsinsectsnaturallyrecognized
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Spiders are arthropods that can be distinguished from their closest relatives, the insects, by counting their legs. Spiders have 8, insects just 6. 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.

Discussion (0). Continue with ORCID to comment.

Pith tools