|
|
|
|
order (of a graph)
|
(Definition)
|
|
|
The order of a graph $G$ is the number of vertices in $G$ it is denoted by $|G|$ The same notation is used for the number of elements (cardinality) of a set. Thus, $|G| = |V(G)|$ We write $G^n$ for an arbitrary graph of order n. Similarly, $G(n,m)$ denotes an arbitrary graph of order n and size m.
|
"order (of a graph)" is owned by Mathprof. [ full author list (2) | owner history (1) ]
|
|
(view preamble | get metadata)
Cross-references: size, cardinality, vertices, number, graph
There are 36 references to this entry.
This is version 5 of order (of a graph), born on 2002-03-07, modified 2006-10-13.
Object id is 2762, canonical name is OrderOfAGraph.
Accessed 9879 times total.
Classification:
| AMS MSC: | 05C99 (Combinatorics :: Graph theory :: Miscellaneous) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|