Seethalakshmi R. (SASTRA University (Deemed), India)

Copyright: © 2020
|Pages: 17

DOI: 10.4018/978-1-5225-9380-5.ch014

Chapter Preview

TopMathematics acts a critical and essential need in different fields. One of the significant roles in Mathematics is played by Graph theory of structural models. The structural arrangement paves the way for innovative methods models in various disciplines for better strategic decisions

In mathematics, graph theory is the study through graphs by which the structural relationship studied with a pairwise relationship between different objects. A graph consists of lines or arcs connected by nodal points or vertices which are also connected edges. The different types of network theory or models or model of the network are called as graphs. These graphs do not form a part of analytical geometry, but they called as graph theory which is ‘ points connected by lines.’

A pair that has set of nodes V(G) and a set of edges E(G) is called a graph, represented by G = (V, E). The adjacency relation of a graph G is a symmetric binary relation induced by the edge set E(G) on a vertex set V(G). Dual nodes i and j are said to be adjacent when there exists an edge between i and j.

The number of edges incident on a node ‘i' is representing the amount of that node and is named by ‘d_{i}^{.’} There are two types of graph namely ‘Direct graph’ and ‘Indirect graph.’ The ‘in degree, di-’ and ‘out degree, di+,’ of node i are to be distinguished in the direct graph.

The nodes in an undirected graph are connected by bidirectional edges. On the other hand, the nodes in a direct graph are connected by edges that point in one direction.

A regular graph consists of nodes all of which are of the same degree. For example, all nodes in of ‘k-regular’ graph are of degree ‘k.’

The *adjacency matrix*, **A**(*G*) in the graph *G*, is a square matrix of order n in which the entry *a _{ij}* is 1if the edge

A sequence of edges and nodes which are connected in such a way that all nodes are distinct from each other. For example, P_{k} denotes a path with ‘k’ nodes. The number of edges in a path is said to be the path length and is represented by d(u, v).

The utmost or maximum of d(u,v) over all nodes u and v is said to be the diameter of a graph.

The list *{v*_{0}, *e*_{01}, *v*_{1}*,...,v _{k−}*

The no repeated edge with the walk is known as a *trail and with no* repetitive node is a path.

The shortest path distance between the two nodes are called as Geodesic distance.

A closed trail is called as a circuit. In a circuit, the endpoints of a trail are the same.

If a circuit has no repeated node, then it is called a *cycle*. *A cycle* on *n* nodes is denoted by *C _{n}. A c*ycle can be a circuit whereas a cycle need not be a circuit.

Search this Book:

Reset

Copyright © 1988-2019, IGI Global - All Rights Reserved