edgeless graph
graph without edges (on any number of vertices)
Facts
9 properties- Instance of
- class of the graphs without certain subgraphs
- Subclass of
- simple graph, strongly regular graph, linear forest, perfect graph, sparse graph, integral graph, split graph, bishop's graph, uniquely colorable graph, bridgeless graph, threshold graph, Turán graph[2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21]
+8 more
Kneser graph, well-covered graph, line graph, cluster graph, co-diamond-free graph, stepwise irregular graph, knight's graph, disconnected graph - Different from
- order-zero graph
- Does not have part
- edge, complete graph K2
- Has characteristic
- chromatic number
- Has part(s)
- isolated vertex[23]
- Has parts
- isolated vertex
- Opposite of
- complete graph[22]
- Studied by
- graph theory
🏷️ Also known as
en K2-free graph
en null graph
en 0-regular graph
en edgeless graph
en empty graph
ar بيان عديم الأضلاع
ar بيان عديم الوصلات
ar بيان خال
cs diskrétní graf
de 0-regulärer Graph
de leerer Graph
de Nullgraph
de kantenloser Graph
el μηδενικός γράφος
el 0-κανονικός
es grafo nulo
es grafo vacio
es grafo vacío
fa گراف تهی
fr graphe vide
🔖 Identifiers · 8
- OpenAlex ID
- C17169500
- Image (Wikimedia Commons)
- 0-regular graph.svg ↗
- Freebase ID
- /m/057ntc
- Graphclasses.org ID
- gc_1247
- MathWorld ID
- EmptyGraph
- Microsoft Academic ID (discontinued)
- 17169500
- ProofWiki ID
- Definition:Edgeless_Graph
- Wolfram Language entity code
- Entity["GraphClass", "Empty"]
🔗 Connections
Subclass of 10
Different from 1
Does not have part 1
Examples 1
Has characteristic 1
Maintained by WikiProject 1
Opposite of 1
Studied by 1
Subtypes 1
← Different from 1
← Opposite of 1
Press Enter · cited answer in seconds
0 sources
Summary
edgeless graph is a class of the graphs without certain subgraphs[1].