independence number

independence number

[‚in·di′pen·dəns ‚nəm·bər]
(mathematics)
For a graph, the largest possible number of vertices in an independent set. Also known as internal stability number.
References in periodicals archive ?
will take significantly The 2015 UK general election factor in be a complicating negotiations, if the Labour Party independence number of secure a substantial seats in Scotland but fail to win or outright majority commanding in the House of Commons.
Thus the independence number of SR(d, n) is the maximum number of nonattacking rooks that can be placed on a simplicial chessboard with n + 1 "squares" on each side.
The smallest eigenvalue is significant in spectral graph theory; for instance, it is related to the independence number (Godsil and Royle, 2001, Lemma 9.
The independence number and edge independence number of G are respectively denoted by [[beta].
Graph coloring and related topics of cliques, independence numbers, and graph factorization are addressed next.

Full browser ?