GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Algebra
  • Applied Mathematics
  • Calculus and Analysis
  • Discrete Mathematics
  • Foundations of Mathematics
  • Geometry
  • History and Terminology
  • Number Theory
  • Probability and Statistics
  • Recreational Mathematics
  • Topology
  • Alphabetical Index
  • Random Entry
  • New in MathWorld

This view

  • Original page
  • New address

GeezerVison is showing mathworld.wolfram.com — Vertex Count -- from Wolfram MathWorld

Search

Vertex Count

DOWNLOAD Mathematica NotebookDownload Wolfram Notebook

The vertex count of a graph g is the number of vertices in g and is also called the graph order. Common notations are V(g) and |g|. Equivalently, the vertex count is the cardinality of the vertex set.

The vertex count of a graph is implemented in the Wolfram Language as VertexCount[g]. The numbers of vertices for many named graphs are given by the command GraphData[graph, "VertexCount"].

See also

Cardinality, Edge Count, Graph Order, Graph Vertex, Vertex Set

Explore with Wolfram|Alpha

WolframAlpha

More things to try:

  • graph properties
  • (A union B) intersect C
  • gamma(x) integral representation

Cite this as:

Weisstein, Eric W. "Vertex Count." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/VertexCount.html

Subject classifications

You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.