(thing) by artemis entreri Sun Feb 11 2001 at 5:58:56
In combinatorics, a set of nodes in a graph is called stable if none of them are joined to one another.

--back to combinatorics--
I like it!

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