independence number
size of an independent set of graph vertices of maximal size
Facts
8 properties- Instance of
- graph property
- Subclass of
- cardinality, non-negative integer[2][3]
- Defining formula
- \alpha(G)=\omega(\overline{G})
- Greater than
- independent domination number, fractional independence number, Havel–Hakimi residue, average distance of a graph[6][7][8][9]
- In defining formula
- \alpha(G), \omega, \overline G
- Less than
- Shannon capacity, upper domination number, annihilation number[10][11][12]
- Maintained by WikiProject
- WikiProject Mathematics[13]
- Opposite of
- clique number, vertex cover number[4][5]
🏷️ Also known as
en packing number
en point independence number
en stable set number
en stability number
en 1-packing number
en co-clique number
en coclique number
en independence number
en internal stability number
cs nezávislost
cs nezávislost grafu
de Unabhängigkeitszahl
de Stabilitätszahl
es número de independencia
fr taille maximum d'un stable
it numero d'indipendenza
nl onafhankelijkheidsgetal
nl stabiliteitsgetal
ru неплотность
ru число внутренней плотности
🔖 Identifiers · 3
- Google Knowledge Graph ID
- /g/11fv44l8h0
- Graphclasses.org ID
- par_8
- MathWorld ID
- IndependenceNumber
🔗 Connections
Instance of 1
Maintained by WikiProject 1
Subclass of 1
← Less than 1
Press Enter · cited answer in seconds
0 sources
Summary
independence number is a graph property[1].