Graph Theory

BASIC CONCEPT OF THE GRAPH THEORY

Slamin & Antonius C.P.

Abstract. A graph G is defined to be a pair of sets (V (G),E(G)), where V (G) is a finite nonempty set of elements called vertices, and E(G) is a set (possibly empty) of unordered pairs {u, v} of vertices u, v in V (G) called edges. V (G) is called the vertex-set of G and E(G) is called the edge-set of G. A graph G may contain loops, that is, edges of the form {u, u}, and/or multiple edges, that is, edges which occur more than once.

See the full text

 

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s