spider graph

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

Noun[edit]

spider graph (plural spider graphs)

  1. (mathematics) A graph (set of connected points) that has one vertex of degree at least three, and all other vertices of degree two or less

Synonyms[edit]