Synopsis

Submitted along with application for registration doing PhD in Mathematics

Mahatma Gandhi University Kottayam

Title1: Application of Graph theory in

some/different/various netwoks

Title2: Application of Graph theory in traffic, computer,

electrical,communication and social netwoks

Introduction

Definition of a graph

Graphs are amenable for pictorial representation of a system using two basic components vertex

and edges. A vertex is represented by a dot and an edge is represented by line segment connecting

the dots associated with the edge. If the edges of a graph direct one vertex to the other vertex, then

the graph is called as a directed graph. Otherwise graph is called an undirected graph. Formally, a

graph G= (V, E) contains a finite set V= (v1, v2,…..,vn) of elements called vertices and a finite set

(e1 ,e2,…..,em) of elements called edges

Electrical; In electrical engineering the word is used for edge, node for vertex and loop for circuit.
An electrical network is the set of electronic components i.e. resistors, inductors and capacitors etc.

Electric network analysis and synthesis are the study of network topology. Electric network problem

can be represented by drawing graphs. In this paper, we present a circuit network in the concept of

graph theory application and how to apply graph theory to model the circuit network.
A connected graph without closed path i.e. tree was implemented by G.Kirchhoff in 1847 and he

employed graph theoretical concept in the calculation of currents in network or circuits and was

improved upon J.C.Maxwell in 1892.[4] Ever since, graph theory has been applied in electrical

network analysis .An electrical network is a collection of components and device interconnected

electrically .The network components are idealized of physical device and system, in order to for

them to represent several properties, they must obey the Kirchhoff’s law of currents and voltage.

[1]A graph representation of electrical network in terms of line segments or arc called edges or

branches and points called vertices or terminals.

Labeled graphs serve as useful models for a broad range of applications such as: coding

theory, x-ray crystallography, radar, astronomy, circuit design, communication network

addressing and data base management

Traffic: 1)Application of graph theory concept for traffic light control at crossroad

Ekky Kurnia Setiawan, and I. Ketut Budayasa,Published by the American Institute of Physics

By modeling the system of traffic

flows into compatible graph, 2 vertices are represented as the flow connected by an edge

if and only if the flow at the

crossroads can be moved simultaneously without causing crashes. Influenced by the

volume of traffic flows and the

weights of the traffic flow, thus to be created a mathematical model in the form of a graph.

Application of Graph Theory in Transportation Networks

2)Sanjay kumar Bisen, Published by International Journal of Scientific Research and

Management (IJSRM)
When trying to estimate the maximum number of people who can fly from a city Ci to a city

Cj through different routes and airports, one can use a networks N as a model. Let us

assume the source s, as the origin Ci of the trip and the sink t, as the destination Cj,

and the remaining internal nodes vi are the intermediate airports. An arc a = (vi, vj) of N

represents a direct flight from the city vi to the city vj and c(a) denotes the maximum

number of seats available on a direct flight from vi to vj

Proposed research activities

1: In majority of labelings functions are defined to the set of integers. I wish to investigate

the graph labels be taken from R- the set of real numbers or from an interval (a,b). What are

the modifications in the established results in labelings when we are using any real numbers

as labels?

2: Another variation of labels as functions of a parameter t (may be time). We can see lot of

examples of Graphs in which labels may vary as per another parameter especially time.

There is a scope of study based on time labels (labels depends on time).

3: If the labeled functions are periodic then the structure /pattern/behaviour of graphs is

interesting topic for study.

4: Definition of traffic Density function over an edge (road) is the function which give the

traffic problems on a road at time ‘t’. If eij denote such function over an edge between two

vertices vi &vj then we aim to find a path between two towns having the minimum traffic

density. Let P={P1,P2,P3, ……Pm} be set of possible paths from two towns Ta and Tb, A is

the set of distinct edges in P. Traffic probability function(TPF) of Pi is defined by

and Tb at time ‘t’.

Traffic density functions and the problems due to high traffic densities are appeared

in many areas like vehicle traffic on roads, Data transfer traffic between server points of

world wide web etc. By defining Traffic probability function(TPF) on each edges and by

getting its behaviour at different times we may have a scope of reducing high traffic and

deduce problems related with traffic. In my research I plan to detailed study in this area.

References

[1] R.B.Gnanajothi, Topics in Graph Theory, Ph.D Thesis, Madurai Kamaraj University, 1991.

[2] S.W. Golomp, How to number a graph, in Graph theory and Computing, R.C Read, ed.,

Academic Press, NewYork (1972) 23-37

[3] R.L Graham and N.J.A Sloane, On additive bases and harmonious graphs,SIAM.J Alg.

Discrete Math.,1(1980) 382-404

[4] S.M Lee and S.C Shee, OnSkolem-graceful graphs , Discrete Math.,93(1991) 195-200

[5] M. Maheo, Strongly graceful graphs, Discrete Mth., 29 (1980)39-46

[6] M.Maheo and H. Thuillier, On d-graceful graphs, Ars Combin.,13(1982) 181-192.

[7] A.Rosa On Certain valuations of the vertices of a graph, Theory of Graphs ( Internat.

Symposium, Rome,July 1966), Gordon and Breach, N.Y and Dunod Paris(1967) 349-355.