Editing Vertex (graph theory)

{{Short description|Fundamental unit of which graphs are formed}}
{{Other uses|Vertex (disambiguation)}}
{{more footnotes|date=February 2014}}

[[Image:6n-graf.svg|thumb|A graph with 6 vertices and 7 edges where the vertex number 6 on the far-left is a leaf vertex or a pendant vertex]]
In [[discrete mathematics]], and more specifically in [[graph theory]], a '''vertex''' (plural '''vertices''') or '''node''' is the fundamental unit of which graphs are formed: an [[Graph (discrete mathematics)#Graph|undirected graph]] consists of a set of vertices and a set of [[Edge (graph theory)|edges]] (unordered pairs of vertices), while a [[directed graph]] consists of a set of vertices and a set of arcs (ordered pairs of vertices).  In a diagram of a graph, a vertex is usually represented by a circle with a label, and an edge is represented by a line or arrow extending from one vertex to another.

From the point of view of graph theory, vertices are treated as featureless and indivisible [[Mathematical object|objects]], although they may have additional structure depending on the application from which the graph arises; for instance, a [[semantic network]] is a graph in which the vertices represent concepts or classes of objects.

The two vertices forming an edge are said to be the endpoints of this edge, and the edge is said to be incident to the vertices. A vertex ''w'' is said to be adjacent to another vertex ''v'' if the graph contains an edge (''v'',''w''). The [[neighborhood (graph theory)|neighborhood]] of a vertex ''v'' is an [[induced subgraph]] of the graph, formed by all vertices adjacent to&nbsp;''v''.

==Types of vertices==
[[File:Small Network.png|alt=A small example network with 8 vertices and 10 edges.|thumb|Example network with 8 vertices (of which one is isolated) and 10 edges.]]
The [[degree (graph theory)|degree]] of a vertex, denoted 𝛿(v) in a graph is the number of edges incident to it. An '''isolated vertex''' is a vertex with degree zero; that is, a vertex that is not an endpoint of any edge (the example image illustrates one isolated vertex).<ref>[[:File:Small Network.png]]; example image of a network with 8 vertices and 10 edges</ref> A '''leaf vertex''' (also '''pendant vertex''') is a vertex with degree one. In a directed graph, one can distinguish the outdegree (number of outgoing edges), denoted 𝛿<sup> +</sup>(v), from the indegree (number of incoming edges), denoted 𝛿<sup>−</sup>(v); a '''source vertex''' is a vertex with indegree zero, while a '''sink vertex''' is a vertex with outdegree zero. A [[simplicial vertex]] is one whose [[neighborhood (graph theory)|closed neighborhood]] forms a [[clique (graph theory)|clique]]: every two neighbors are adjacent. A [[universal vertex]] is a vertex that is adjacent to every other vertex in the graph.

A [[cut vertex]] is a vertex the removal of which would disconnect the remaining graph; a [[vertex separator]] is a collection of vertices the removal of which would disconnect the remaining graph into small pieces. A [[k-vertex-connected graph]] is a graph in which removing fewer than ''k'' vertices always leaves the remaining graph connected. An [[Independent set (graph theory)|independent set]] is a set of vertices no two of which are adjacent, and a [[vertex cover]] is a set of vertices that includes at least one endpoint of each edge in the graph. The [[vertex space]] of a graph is a vector space having a set of basis vectors corresponding with the graph's vertices.

A graph is [[vertex-transitive graph|vertex-transitive]] if it has symmetries that map any vertex to any other vertex. In the context of [[graph enumeration]] and [[graph isomorphism]] it is important to distinguish between '''labeled vertices''' and '''unlabeled vertices'''. A labeled vertex is a vertex that is associated with extra information that enables it to be distinguished from other labeled vertices; two graphs can be considered isomorphic only if the correspondence between their vertices pairs up vertices with equal labels. An unlabeled vertex is one that can be substituted for any other vertex based only on its [[Adjacency (graph theory)|adjacencies]] in the graph and not based on any additional information.

Vertices in graphs are analogous to, but not the same as, [[vertex (geometry)|vertices of polyhedra]]: the [[skeleton (topology)|skeleton]] of a polyhedron forms a graph, the vertices of which are the vertices of the polyhedron, but polyhedron vertices have additional structure (their geometric location) that is not assumed to be present in graph theory. The [[vertex figure]] of a vertex in a polyhedron is analogous to the neighborhood of a vertex in a graph.

==See also==

* [[Node (computer science)]]
* [[Graph theory]]
* [[Glossary of graph theory]]

==References==
{{reflist}}

* {{cite journal
  | last1 = Gallo
  | first1 = Giorgio
  | last2 = Pallotino
  | first2 = Stefano
  | title = Shortest path algorithms
  | journal = Annals of Operations Research
  | volume = 13
  | issue = 1
  | pages = 1–79 <!-- the inline reference refers to page 4 -->
  | year = 1988
  | doi = 10.1007/BF02288320
  | s2cid = 62752810
 }}
* [[Claude Berge|Berge, Claude]], ''Théorie des graphes et ses applications''. Collection Universitaire de Mathématiques, II Dunod, Paris 1958, viii+277 pp. (English edition, Wiley 1961; Methuen & Co, New York 1962; Russian, Moscow 1961; Spanish, Mexico 1962; Roumanian, Bucharest 1969; Chinese, Shanghai 1963; Second printing of the 1962 first English edition. Dover, New York 2001)
* {{Cite book | last=Chartrand | first=Gary | author-link=Gary Chartrand | title=Introductory graph theory | date=1985 | publisher=Dover | location=New York | isbn=0-486-24775-9 | url-access=registration | url=https://archive.org/details/introductorygrap0000char }}
* {{Cite book |author1=Biggs, Norman |author2=Lloyd, E. H. |author3=Wilson, Robin J. | title=Graph theory, 1736-1936 | date=1986 | publisher=Clarendon Press | location=Oxford [Oxfordshire] | isbn=0-19-853916-9 |title-link=Graph Theory, 1736–1936}}
* {{Cite book | last=Harary | first=Frank | author-link=Frank Harary | title=Graph theory | date=1969 | publisher=Addison-Wesley Publishing | location=Reading, Mass. | isbn=0-201-41033-8 }}
* {{Cite book |author1=Harary, Frank |author2=Palmer, Edgar M. | title=Graphical enumeration | date=1973 | publisher=New York, Academic Press | isbn=0-12-324245-2 }}

==External links==
*{{mathworld | title = Graph Vertex | urlname = GraphVertex}}

{{DEFAULTSORT:Vertex (Graph Theory)}}
[[Category:Graph theory objects]]