Professional Documents
Culture Documents
07 - Chapter 01 PDF
07 - Chapter 01 PDF
Introduction
1
1.1 Introduction
ory of Graphs is in the field of Graph Theory, which is one of the ever
tions to the problems originating from various fields like engineering, social
ters in graph valued functions and also relations with graph theoretical
2
Pertinentis [30] published in 1736 by the Swiss Mathematician Leonhard
Euler(1707-1783). The main idea behind this work grew out of a popular
was located on the Pregel River in Prussia. The city occupied two islands
plus areas on both the banks. The citizens wondered whether they could
leave home, cross every bridge exactly once and return home. The famous
More than a century after Euler’s paper, Cayley was led by the study
particular class of graphs called the trees. This study has many implica-
The fusion of the ideas coming from Mathematics with those coming from
theory.
3
relationship between them by edges, if relationship exists between any two
objects(vertices) then we say they adjacent to each other. The term graph
graph theory back through the work of Jordan, Kuratowski and Whitney.
by Frank Harary [32], published in 1969, was enormously popular and en-
not possible to retrieve the original graph from the transformation graph
4
in polynomial time. Hence these graph transformations may be used in
between vertices and edges and adjacency relation between two vertices or
We begin with some graph valued functions of a graph which are the
most interesting operations by which one graph is obtained from the other.
vertex set 𝑉 (𝐺) in which two vertices are adjacent if and only if they are
5
in each edge of 𝐺 . Now the graph valued function which has received
the most attention, is the concept of line graph, first studied by Whitney
set as the edge set of 𝐺 and two vertices of 𝐿(𝐺) are adjacent whenever
𝐽(𝐺) of a graph 𝐺 is a graph whose vertex set is the edge set of 𝐺 and
two vertices of 𝐽(𝐺) are adjacent if and only if the corresponding edges
the middle graph, which has been introduced by Hamada and Yoshimura
[33]. The middle graph 𝑀(𝐺) of a graph 𝐺 , is a graph whose vertex set
is the union of vertex set and edge set of 𝐺 , where two vertices of 𝑀(𝐺)
are adjacent if and only if either they are adjacent edges of 𝐺 or one is a
vertex and other is an edge of 𝐺 incident with it. The concept of middle
6
𝑇2(𝐺) of a graph 𝐺 , which is a graph with vertex set 𝑉 (𝐺) ∪ 𝐸(𝐺) in
which two vertices are adjacent if and only if they are adjacent vertices of
with vertex set as a set of all blocks of 𝐺 and two vertices of 𝐵(𝐺) are
adjacent if and only if the corresponding blocks have the common vertex
set of vertices having at least two vertices and having the same degree and
from 𝐺 by adding vertices 𝑊1, 𝑊2, ...., 𝑊𝑡 and joining 𝑊𝑖 to each vertex
is a total graph. The total graph 𝑇 (𝐺) of a graph 𝐺 is the graph whose
vertex set is 𝑉 (𝐺) ∪ 𝐸(𝐺) and in which two vertices are adjacent if and
Meng [61], which is our aim to study the new graphical transformations
7
the edges of 𝐺 are called the elements of 𝐺 .
terms of 𝑥𝑦𝑧 .
actly the total graph 𝑇 (𝐺) of 𝐺 and 𝐺−−− is the complement of 𝑇 (𝐺) .
Also for a given graph 𝐺 , 𝐺++− and 𝐺−−+ , 𝐺−+− and 𝐺+−+ , 𝐺−++
8
1.4 Brief history of domination theory of graphs
The fastest growing area within graph theory is the study of domination
historical root of domination has its origin in the game of chess, where the
posed the following chess board problem: Determine the minimum num-
ber of queens that can be placed on a chessboard such that every square
single move.
problem we are looking for the minimum number of queens that domi-
comprehensive survey of chess board problem see [28], Cockayne et.al [27]
9
[29], Hedetniemi et.al [36], Spencer and Coackayne [57] and Wagner and
Geist [59].
The topic of domination began with Claude Berge [19] in 1958 and
Oystein Ore [51] in 1962, with Ore actually using the term ”domination”
for undirected graphs and also he introduced the concept of minimal and
ters, containing at that time about 400 entries. At the end of 1997, this
bibliography has grown to over 1200 entries. In 1998, a first large volume
At the end of 2006, domination theory and its related parameters has
10
recent book on domination by Kulli can be found in [48].
Hence in last three decades domination has emerged as one of the signif-
icant area of research not only in graph theory but also in combinatorial
The contents of this thesis is organized into eight chapters and are con-
veniently categorized into three parts. The first part consist of three
chapters from the beginning in which first Chapter deals brief history,
The second part of the thesis contains two chapters, Chapter four
and five which deals with the edge decomposition of the transformation
11
graphs 𝐺++− and 𝐺+−− into some standard class of graphs.
Chapters 6,7 and 8 constitutes the third part of the thesis, which are
graph of a graph.
mation graph 𝐺+−+ of 𝐺 and the upper bounds for 𝐺+−+ . In Chapter
terms of elements of 𝐺 but not the elements of 𝑇2(𝐺) are derived. Chap-
ter eight gives the variation in domination from the graph 𝐺 to the
are obtained.
contained.
12
finite set whose elements are called vertices (points) and 𝐸(𝐺) is a set of
called edges (lines) of the graph 𝐺 . Graphs discussed in this thesis are
[32].
(1, 0) graph is trivial. A graph with more than one vertex is a nontrivial
13
vertex of degree zero in 𝐺 is called an isolated vertex. A vertex of degree
sum of the degrees of u and v. The minimum degree among all the ver-
beginning and ending with vertices, in which each edge is incident with
the two vertices immediately preceding and following it. A trail is a walk
in which all the edges are distinct and it is a path if all the vertices are
of its vertices are joined by a path. A graph which is not connected is said
14
to be disconnected. A graph whose edge set is empty is called a totally
𝑣 and all other vertices of 𝐺 , i.e, 𝑒𝑐𝑐𝐺 (𝑣) = 𝑚𝑎𝑥{𝑑(𝑢, 𝑣)/∀𝑢 ∈ 𝑉 (𝐺)} .
15
cover of 𝐺 and is called edge covering number of graph 𝐺 . A set of
graph is said to be bipartite graph or bigraph if its vertex set 𝑉 (𝐺) can
16
three stars by two edges. The neighborhood of a vertex 𝑢 in 𝑉 is the set
𝑁 (𝑢) consisting of all vertices 𝑣 which are adjacent with 𝑢 . The closed
edge set 𝐸(𝐺) = 𝐸(𝐺1) ∪ 𝐸(𝐺2) . The join of two graphs is denoted by
two vertices (𝑢1, 𝑢2) and (𝑣1, 𝑣2) being adjacent in 𝐺1 × 𝐺2 if and only
17
domination number 𝛾(𝐺) of 𝐺 is the minimum cardinality of a minimal
1.7 Applications
Graphs can be used to model many types of relations and process dynam-
✠ Radar network: Berge in his book Graphs and Hyper graphs (1973),
mentions the problem of keeping all points in a network under the surveil-
called cells are kept under the surveillance of radar. suppose Radar in
the network.
18
✠ Road networks: Suppose 𝐺 is a graph representing a network of
tions.
unusable and the communication computers may also fail. Graph theory
vices, the flow of computation etc. For example: The link structure of a
19
website could be represented by a directed graph. The vertices are the
web pages available at the website and directed edges from page A to B
semantics follow tree based structures, whose expressive power lies in the
graphs) and morphology (e.g. finite state morphology, using finite state
20
communication, radar station location, coding theory, computer network-
ing etc.
searching. Also graph theoretic methods are useful in finding the energy
21