Scribd
Upload
9 views5 pages

10 TH Reference Text - Graph Theory A Definitions

This document provides an introduction to graph theory, detailing key definitions and concepts such as vertices, edges, degrees, and types of graphs including complete and bipartite graphs. It explains various graph properties, including walks, trails, paths, cycles, and connectedness, as well as the concept of trees and spanning trees. Additionally, exercises are included to reinforce understanding of these concepts.

Uploaded by

shahilmanilall15.07
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views5 pages

10 TH Reference Text - Graph Theory A Definitions

This document provides an introduction to graph theory, detailing key definitions and concepts such as vertices, edges, degrees, and types of graphs including complete and bipartite graphs. It explains various graph properties, including walks, trails, paths, cycles, and connectedness, as well as the concept of trees and spanning trees. Additionally, exercises are included to reinforce understanding of these concepts.

Uploaded by

shahilmanilall15.07
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

GRAPH THEORY A -DEFINITIONS

Introduction and main definitions

The history of graph theory may be specifically traced to 1735, when the Swiss
mathematician Leonhard Euler solved the Königsberg bridge problem. ... His proof involved
only references to the physical arrangement of the bridges, but essentially he proved the first
theorem in graph theory.

A graph G = (V , E ) consists of a finite non-empty set V of elements called vertices, and


a (possibly empty) set E of 2-element subsets of V called edges. The number n of
elements in V is called the order and the number m of elements in E is called the size of
G. All graphs which we shall consider will be finite, simple and undirected.

If G has only one vertex, then G is trivial; otherwise G is non-trivial.

Let e = u, v E(G). Then we say u and v are adjacent, while e is incident with u and
v. We also say that e joins u and v. Instead of writing e = u , v, we can also write e = uv .
The degree of a vertex v in G, denoted deg(v), is the number of edges incident with v. By
deg(G) we mean a listing of the degrees of the graph G in descending order. A vertex of
degree 1 is called an end-vertex. A k-regular graph is a graph where each vertex has
degree k.

The maximum (minimum) degree (G) =  (δ(G) = δ) of G is the maximum (minimum)


of the degrees of the vertices in G.

The neighbourhood 𝑁𝐺 (𝑣) of a vertex v  V , is the set of all adjacent vertices to v in G.

G\x is obtained from G by removing vertex x, and G\xy is obtained from graph G by
removing adjacent vertices x and y.

The complement G of a graph G is a graph whose vertex set is the same as G , but if
there is no edge between vertices u and v in G , then there is an edge between u and v
in G. , and if there is an edge between u and v in G, there is no edge between u and v
in G.

The complete graph is a graph in which every pair of vertices in G is adjacent in G.

Eg. K7, a complete graph with 7 vertices

Exercise
Number of vertices =?
Number of edges =?
Maximum degree=?
Minimum degree=?
Complement =?

A bipartite graph is a graph whose vertices can be divided into two disjoint sets U and V
such that every edge connects a vertex in U to one in V. A complete bipartite graph (or
bi-clique) is a special kind of bipartite graph where every vertex of the first set is
connected to every vertex of the second set.

A sub-graph of a graph G is a graph whose vertex set is a subset of that of G , and


whose adjacency relations are a subset of that of G , restricted to the vertices in this
subset.

A walk W in a graph G is an alternating sequence W : v0 , e1 , v1 , e2 ,..., vr −1 , er , vr of


vertices and edges (not necessarily distinct) such that ei = vi −1vi for i = 1,..., r. Since
the vertices that appear in a walk determine the edges in the walk, we can omit the
edges in the description of a walk, and denote the walk W by v0 , v1 ,..., vr −1 , vr . We say
that r is the length of W, and that W begins at v 0 and ends at v r .

If all the edges of the walk are distinct, then the walk is called a trail. If all the vertices of
the walk are distinct, then the walk is called a path. Therefore every path is a trail, but
not every trail is a path.

A closed path or cycle is a path v1 , v2 ,..., vk −1 , vk , for k  3, together with edge vk v1 .


Similarly, a trail that begins and ends at the same vertex is called a closed trail or a
circuit. The length of a path (or trail, cycle or circuit) is its number of edges, including
any repetitions.

The distance between two vertices u and v, d (u,v), is the length of the shortest u − v
path in G.

A graph G is connected if every pair of vertices of G is joined by a path and a


component of G is a maximal connected sub-graph of G. If there is no path connecting
the two vertices, i.e., if they belong to different connected components, then
conventionally the distance is defined as infinite. In this thesis, all graphs are assumed to
be connected, unless otherwise stated.

A tree is a connected graph, which does not contain a cycle as a sub-graph. A spanning
tree of a connected graph is a tree which takes in all the vertices of the graph.

Eg. Complete bipartite graph K3,4.

Exercise
Max degree=? d(u1,u3)=? Number of spanning trees=? Length of largest cycle? Length of longest
path=?

Eg. A tree graph on 6 vertices

Exercise

Maximum degree=?

Minimum degree=?

Complement =?

d(1,6)=?

Eg. Graph on 10 vertices

Exercise

Number of different cycles =?

Number of different spanning trees =?

Length of largest cycle?

Length of longest path=?

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy