St.

Vincent Pallotti College Of Engineering And Technology

B-Tech/Sem 4th

FACULTY NAME:-
Dr.SUCHETA MOHARIR TOPIC-:GRAPHS

BRANCH-: CYBER GROUP I MEMBERS NAME:

SECURITY 1. Akanksha Bhajipale -02
2. Esha Borikar-05
3. Mahek Sheikh-07
4. Sakshi Malekar-10
SUBJECT-: MATHEMATICS 5. Sanjana Sanjai-11
FOR CYBER SECURITY 6. Sushama Shilar-14
INTRODUCTION TO
GRAPHS

1 DEFINITION 2 PURPOSE
Graphs are mathematical structures that In cybersecurity, graphs are used to
consist of nodes (vertices) connected by model network topologies, analyze
edges (lines). network traffic patterns, detect
Notation: A graph is typically denoted anomalies or intrusions, and optimize
as G=(V,E), where: security measures. Graph algorithms
V is a set of vertices. can help identify vulnerabilities, predict
E is a set of edges, where each edge is a attack paths, and improve overall
pair of vertices. network security.
TYPES OF GRAPHS
TYPES OF GRAPHS
TYPES OF GRAPHS
BASIC TERMINOLOGY
BASIC TERMINOLOGY
BASIC TERMINOLOGY
 BASIC TYPES OF
TERMINOLOGY GRAPHS
1 NULL GRAPH
1 NULL GRAPH
2 TRIVIAL GRAPH
2 TRIVIAL GRAPH
3 DIRECTED GRAPH
3 DIRECTED GRAPH
4 UNDIRECTED GRAPH
4 UNDIRECTED GRAPH
5 WEIGHTED GRAPH
5 SELF LOOP
6 COMPLETE GRAPH
6 PROPER EDGE GRAPH
7 REGULAR GRAPH
7 MULTI EDGE GRAPH
8 SIMPLE GRAPH
8 SIMPLE GRAPH
9 CYCLIC AND ACYCLIC GRAPH
9 MULTI GRAPH
10 WHEEL GRAPH
10 PSEUDO GRAPH
11 FINITE GRAPH
11 FINITE GRAPH
12 INFINITE GRAPH
12 INFINITE GRAPH
13 BIPARTITE GRAPH
13 INCIDENCE AND ADJACENCY
14 COMPLETE BIPARTITE GRAPH
14 DEGREE OF VERTEX
15 CONNECTED GRAPH
15 ISOLATED AND PENDANT VERTEX
SUBGRAPHS

Let G = (V, E) be a graph with a vertex set V and an edge set E.

A graph H = (V', E') is considered a subgraph of a graph G if and only if:

V' is a subset of V, which means every vertex in H is also in G.

E' is a subset of E, which means every edge in H is also in G.
For any edge e in E', its endpoints (vertices) are also in V'. In other words, if
an edge is part of H, then the vertices it connects must also be part of H.
 ISOMORPHIC
GRAPHS
A graph can exist in different forms having the same number of vertices, edges, and also the same edge
connectivity. Such graphs are called isomorphic graphs.
Note
If G1 ≡ G2 then −
|V(G1)| = |V(G2)|
|E(G1)| = |E(G2)|
Degree sequences of G1 and G2 are same.
If the vertices {V1, V2, .. Vk} form a cycle of length K in G1, then the vertices {f(V1), f(V2),… f(Vk)}
should form a cycle of length K in G2.
All the above conditions are necessary for the graphs G1 and G2 to be isomorphic, but not sufficient to
prove that the graphs are isomorphic.

Any two graphs will be known as isomorphism if they satisfy the following four conditions:
1. There will be an equal number of vertices in the given graphs.
2. There will be an equal number of edges in the given graphs.
3. There will be an equal amount of degree sequence in the given graphs.
4. If the first graph is forming a cycle of length k with the help of vertices {v1, v2, v3, …. vk}, then
another graph must also form the same cycle of the same length k with the help of vertices {v1, v2, v3,
…. vk}.
ADJACENCY
MATRIX
If an Undirected Graph G consists of n vertices
then the adjacency matrix of a graph is n x n
matrix A = [aij] and defined by -
aij = 1 {if there is a path exists from Vi to Vj}
History of Graphs
1 Early Beginnings
Graph theory has its roots dating back to the 18th century, with the famous "Bridges of
Königsberg" problem solved by Leonhard Euler in 1736.

2 Mathematical foundation
In the 19th century, mathematicians like Gustav Kirchhoff and Arthur Cayley further
developed the theoretical foundations of graph theory.

3 Modern Advancements
The 20th century saw a surge in graph theory research, driven by applications in
computer science, operations research, and social network analysis.
 The properties related to a graph are listed below.

⚬ Distance between two vertices is basically the number of edges in the

shortest path between vertex X and vertex Y. The distance between
two vertices is denoted by d(X, Y).
⚬ Eccentricity of a vertex is the maximum distance between one vertex

Properties of to all other vertices. It is represented as e(V).

⚬ Radius of a connected graph is the minimum eccentricity from all the
vertices. It is represented as r(G).

Graphs ⚬ Diameter of a graph is the maximum eccentricity from all the vertices
of the graph. It is represented as d(G).
⚬ If the eccentricity of the graph is equal to its radius then it is known as
the central point of the graph.
⚬ The set of all the central point of a graph is known as the center of the
graph
⚬ The total number of edges in the longest cycle of graph G is known as
the circumference of the graph G.
⚬ The total number of edges in the shortest cycle of graph G is known
as girth. It is represented as g(G).
WALK
Walk can be open or closed.
Open walk- A walk is said to be an open walk if the starting
and ending vertices are different i.e. the origin vertex and
terminal vertex are different.
Closed walk- A walk is said to be a closed walk if the
starting and ending vertices are identical i.e. if a walk starts
and ends at the same vertex, then it is said to be a closed
walk.
In the above diagram:

TRIAL
Trail is an open walk in
which no edge is repeated.
Vertex can be repeated.
PATH It is a trail in which neither vertices nor edges are repeated
i.e. if we traverse a graph such that we do not repeat a vertex
and nor we repeat an edge. As path is also a trail, thus it is
also an open walk.

Another definition for path is a walk with no repeated vertex.

This directly implies that no edges will ever be repeated and
hence is redundant to write in the definition of path.

Vertex not repeated

Edge not repeated

CIRCUIT
Traversing a graph such that not an edge is repeated but
vertex can be repeated and it is closed also i.e. it is a
closed trail.

Vertex can be repeated.

Edge can not be repeated.
CYCLE
Traversing a graph such that we do not repeat a vertex nor we
repeat a edge but the starting and ending vertex must be same
i.e. we can repeat starting and ending vertex only then we get
a cycle.

Vertex not repeated

Edge not repeated

SUMMARY
 EULER EULER EULER PATH
GRAPH CIRCUIT

If there is a connected graph with a circuit that has all the edges of
We can also call the Euler path as Euler walk or Euler
the graph, then that type of circuit will be known as the Euler
circuit. Trail. The definition of Euler trail and Euler walk is
If there is a connected graph, which has a walk that passes through described as follows:
each and every edge of the graph only once, then that type of walk If there is a connected graph with a trail that has all the
will be known as the Euler circuit. In this walk, the starting vertex edges of the graph, then that type of trail will be known
If all the vertices of any and ending vertex must be the same, and this walk can contain the as the Euler trail.
repeated vertex, but it is not compulsory.
connected graph have an even If there is a connected graph, which has a walk that
If an Euler trail contains the same vertex at the start and end of the
degree, then this type of graph trail, then that type of trail will be known as the Euler Circuit. passes through each and every edge of the graph only
A closed Euler trail will be known as the Euler Circuit. once, then that type of walk will be known as the Euler
will be known as the Euler
Euler circuit = ABCDFBEDA walk.
graph. Euler path = BCDFBEDAB
KRUSKAL'S
ALGORITHM Kruskal's algorithm is a greedy algorithm that finds a minimum spanning tree
for a connected weighted graph. It finds a tree of that graph which includes
every vertex and the total weight of all the edges in the tree is less than or equal
to every possible spanning tree.

Algorithm
Step 1 − Arrange all the edges of the given graph G(V,E)
in ascending order as per their edge weight.

Step 2 − Choose the smallest weighted edge from the graph and check if it
forms a cycle with the spanning tree formed so far.

Step 3 − If there is no cycle, include this edge to the spanning tree else discard
it.

Step 4 − Repeat Step 2 and Step 3 until (V−1)

number of edges are left in the spanning tree.
KRUSKAL'S
ALGORITHM Since we got all the 5
edges in the last figure,
we stop the algorithm and
this is the minimal
spanning tree and its total
weight is
(1+2+3+5+9)=20
PRIM'S
ALGORITHM Prim's algorithm, discovered in 1930 by mathematicians, Vojtech Jarnik and Robert C. Prim, is
a greedy algorithm that finds a minimum spanning tree for a connected weighted graph. It finds
a tree of that graph which includes every vertex and the total weight of all the edges in the tree
is less than or equal to every possible spanning tree. Prim’s algorithm is faster on dense graphs.

Algorithm
Initialize the minimal spanning tree with a single vertex, randomly chosen from the graph.

Repeat steps 3 and 4 until all the vertices are included in the tree.

Select an edge that connects the tree with a vertex not yet in the tree, so that the weight of the
edge is minimal and inclusion of the edge does not form a cycle.

Add the selected edge and the vertex that it connects to the tree.
PRIM'S
ALGORITHM

This is the minimal

spanning tree and its total
weight is
(1+2+3+5+9)=20.
Formulae of Graphs

Handshaking Lemma-The sum

of the degrees of the vertices of
a graph G=(V, E) is equal to Euler formula :The equation is
twice the number of edges in called Euler's formula for
G.That is, ∑v∈Vd(v)=2 |E|. planar graphs.
Number of Edges in a
Theorem (Dirac) on Hamiltonian Degree Sum Formula:The sum of the Complete Graph:∣E∣=
graphs:A simple graph, with n≥3 degrees of all vertices in a graph is equal n(n−1)/2
vertices, is Hamiltonian if every vertex to twice the number of Number of Vertices in a Regular
v has degree d(v)≥n2. edges.∑v∈Vdeg(v)=2|E| Graph:∣V∣= k⋅∣E∣/2
 Importance of graphs in cyber
security

Cybersecurity knowledge graphs Graphs can be used for cybersecurity Graphs can be used in cybersecurity to The paper discusses the use of attack
provide a holistic approach for by capturing correlations between represent cyber-knowledge, visualize graphs in cybersecurity to predict
processing complex cybersecurity data, cyber entities and modeling the networks, data flow, and attack paths, exploit paths across networks and
assisting security analysts in obtaining relationships and complex interactions and understand data correlations by identify vulnerabilities in the system.
cyberthreat intelligence, visualizing between them. aggregating and fusing data.
networks and attack paths, and
understanding data correlations
Application of Graphs

1 Network Analysis 2 Game theory

Network Analysis: Graphs are widely used to model and Graphs are used to model strategic interactions and
analyze various types of networks, including social decision-making processes in game theory. They help in
networks, computer networks, transportation networks, analyzing strategies, predicting outcomes, and finding
and communication networks. They help in understanding optimal solutions in games such as chess, poker, and
the structure, connectivity, and flow of information or economic games.
resources within these networks.

3 Optimization 4 Cryptography
Graph theory provides powerful tools for Graphs are used in cryptographic protocols and algorithms

optimizing processes, such as finding the for key exchange, authentication, and secure
communication. Graph-based encryption schemes and
shortest path or identifying the most efficient
protocols provide secure and efficient methods for
network configuration.
protecting sensitive information in digital communication
systems.
Future Trends in Graph Theory

Algorithmic Data Visualization Machine Learning Quantum

Advances Computing
Researchers are Innovative graph The integration of graph Ongoing research
developing more visualization techniques theory and machine explores the potential of
efficient algorithms for are emerging, allowing learning is leading to quantum computing to
solving complex graph- users to better advancements in areas solve complex graph-
based problems, understand and interpret like recommendation related problems
enabling new large, intricate network systems, anomaly exponentially faster than
applications in areas like structures and their detection, and predictive classical computers,
logistics, transportation, underlying relationships. modeling. opening new frontiers in
and social network optimization and
analysis. simulation.
Conclusion and Key Takeaways

Embracing Graphs Expanding Future Possibilities Collaborative

Horizons Approach
Graphs are a powerful As technology advances, Graph theory is a Tackling complex graph-
tool in applied the applications of dynamic and ever- related challenges often
mathematics, offering a graphs continue to expanding field, with requires a
evolve. From social
versatile way to researchers continuously multidisciplinary
networks to
visualize and analyze uncovering new insights approach. Fostering
transportation logistics,
complex relationships. and algorithms. Staying collaboration among
graphs are becoming
Mastering graph theory attuned to the latest experts from various
increasingly integral to
can open new doors for developments can help backgrounds can lead to
various industries and
solving real-world you stay ahead of the innovative solutions.
fields of study.
problems. curve.