Spiders can be Recognized by Counting Their Legs
- 206 Downloads
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.
KeywordsPhylogenetics Cograph P4-sparse Spider Degree sequence
Mathematics Subject ClassificationPrimary 05C07 Secondary 05C75
Unable to display preview. Download preview PDF.
- 1.Erdős P., Gallai T.: Gráfok előírt fokszámú pontokkal. Mat. Lapok 11, 264–274 (1960)Google Scholar
- 6.Hernandez-Rosales M., Hellmuth M., Wieseke N., Huber K.T., Moulton P.F., Stadler V.: From event-labeled gene trees to species trees. BMC Bioinform. 13(Suppl 19), S6 (2012)Google Scholar
- 7.Hoàng, C.T.: Perfect graphs. PhD thesis, School of Computer Science, McGill University, Montreal (1985)Google Scholar
- 10.Liu, Y., Wang, J., Guo, J., Chen, J.: Cograph editing: complexity and parametrized algorithms. In: Fu, B., Du, D.Z. (eds.) COCOON 2011. Lect. Notes Comp. Sci., vol. 6842, pp. 110–121. Springer, Berlin (2011)Google Scholar
- 11.Liu, Y., Wang, J., Guo, J., Chen, J.: Complexity and parameterized algorithms for cograph editing. Theor. Comput. Sci. 461(0), 45–54 (2012)Google Scholar