# order (of a graph)

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*.

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) |
---|---|

Canonical name | OrderofAGraph |

Date of creation | 2013-03-22 12:31:23 |

Last modified on | 2013-03-22 12:31:23 |

Owner | Mathprof (13753) |

Last modified by | Mathprof (13753) |

Numerical id | 8 |

Author | Mathprof (13753) |

Entry type | Definition |

Classification | msc 05C99 |

Synonym | order |

Related topic | Graph |

Related topic | SizeOfAGraph |

Related topic | MantelsTheorem |