(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--
del.icio.us Facebook Digg StumbleUpon Reddit   (I like it!)
Y'know, if you log in, you can write something here, or contact authors directly on the site. Create a New User if you don't already have an account.