display | more...
In combinatorics, a set of nodes in a graph is called stable if none of them are joined to one another.

--back to combinatorics--

Log in or register to write something here or to contact authors.