order (of a graph)
The order of a graph is the number of vertices in ; it is denoted by . The same notation is used for the number of elements (cardinality) of a set. Thus, . We write for an arbitrary graph of order n. Similarly, denotes an arbitrary graph of order n and size m.
Adapted with permission of the author from by Béla Bollobás, published by Springer-Verlag New York, Inc., 1998.
|Title||order (of a graph)|
|Date of creation||2013-03-22 12:31:23|
|Last modified on||2013-03-22 12:31:23|
|Last modified by||Mathprof (13753)|