Graph Theory Terminology: Vertices, Edges, Endpoints

AI Thread Summary
In graph theory, vertices, also known as nodes, are the numerical values represented in a graph. The edges are the lines that connect these nodes. End vertices, or endpoints, refer to the two nodes at each end of an edge. In the discussed graph, since it is not directed, there are no incoming or outgoing edges. Understanding these terms is essential for grasping the fundamentals of graph theory.
Gear2d
Messages
49
Reaction score
0
I was wondering if I could get some help with the terminology when it comes to graph theory. In this picture : http://en.wikipedia.org/wiki/Image:6n-graf.svg the numerical values are vertices (or nodes as some call it), so what are the edges then (are they the lines that connect the nodes)? What would be considered a end vertices (endpoints), outgoing edges, and incoming edges?
 
Physics news on Phys.org
Yes, the lines connecting the numbers are the edges. The "end vertices" or "endpoints" of an edge are the two numbers (nodes) at each end of an edge. Since this is not a directed graph (we are not given a direction to each edge- that is "from" one node "to" the other) there are no "incoming" or "outgoing" edges.
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top