Scribd
Upload
9 views

MODULE 1- part 2

The document discusses key concepts in graph theory, including isomorphism, subgraphs, walks, paths, circuits, and the characteristics of connected and disconnected graphs. It defines isomorphic graphs, subgraphs, and the types of walks and paths, while also presenting theorems related to graph connectivity and edge properties. Additionally, it explains the conditions under which graphs can be considered connected or disconnected, along with the implications of vertex degrees.

Uploaded by

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

MODULE 1- part 2

The document discusses key concepts in graph theory, including isomorphism, subgraphs, walks, paths, circuits, and the characteristics of connected and disconnected graphs. It defines isomorphic graphs, subgraphs, and the types of walks and paths, while also presenting theorems related to graph connectivity and edge properties. Additionally, it explains the conditions under which graphs can be considered connected or disconnected, along with the implications of vertex degrees.

Uploaded by

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

ISOMORPHISM

• Two graphs G and G′ are said to be isomorphic (to each other) if there
is a one-to-one correspondence between their vertices and between
their edges such that the incidence relationship is preserved.
• It is immediately apparent by the definition of isomorphism that two
isomorphic graphs must have
1.The same number of vertices.
2. The same number of edges.
3. An equal number of vertices with a given degree.
• The correspondence between the two graphs is as follows: The
vertices a, b, c, d, and www.TechnicalBooksPDF.com e correspond to
v1 , v2 , v3 , v4 , and v5 , respectively. The edges 1, 2, 3, 4, 5, and 6
correspond to e1 , e2 , e3 , e4 , e5 , and e6 , respectively.
SUBGRAPHS
• A graph g is said to be a subgraph of a graph G if all the vertices and
all the edges of g are in G, and each edge of g has the same end
vertices in g as in G.
The following observations can be made immediately:
1. Every graph is its own subgraph.
2. A subgraph of a subgraph of G is a subgraph of G.
3. A single vertex in a graph G is a subgraph of G.
4. A single edge in G, together with its end vertices, is also a subgraph
Edge-Disjoint Subgraphs
• Two (or more) subgraphs g1 and g2 of a graph G are said to be edge
disjoint if g1 and g2 do not have any edges in common.
• Note that although edge-disjoint graphs do not have any edge in
common, they may have vertices in common. Subgraphs that do not
even have vertices in common are said to be vertex disjoint
WALK,PATHS AND
CIRCUITS
WALK
• A walk is defined as a finite alternating sequence of vertices and
edges, beginning and ending with vertices, such that each edge is
incident with the vertices preceding and following it.
• No edge appears (is covered or traversed) more than once in a walk.
• A vertex, however, may appear more than once.
• It is possible for a walk to begin and end at the same vertex. Such a
walk is called closed walk. A walk that is not closed (i.e., the terminal
vertices are distinct) is called an open walk
v1 a v2 b v3 c v3 d v4 e v2 f v5 is a
walk or open walk
PATH
• An open walk in which no vertex appears more than once is called a
path .
• The number of edges in a path is called the length of a path.
• It should also be noted that a self-loop can be included in a walk but
not in a path
• In Fig. 2-8, vl a v2 b v3 d v4 is a path
CIRCUITE
• A closed walk in which no vertex (except the initial and the final
vertex) appears more than once is called a circuit.
• In Fig. 2-8(a), v2 b v3 d v4 e v2 is, for example, a circuit.
• A circuit is also called a cycle, elementary cycle, circular path, and
polygon. In electrical engineering a circuit is sometimes referred to as
a loop—not to be confused with self-loop. (Every self-loop is a circuit,
but not every circuit is a self-loop.)
CONNECTED GRAPHS,
DISCONNECTED GRAPHS,
AND COMPONENTS
• A graph G is said to be connected if there is at least one path between
every pair of vertices in G. Otherwise, G is disconnected.
• It is easy to see that a disconnected graph consists of two or more
connected graphs. Each of these connected subgraphs is called a
component.
THEOREM 2-1
A graph G is disconnected if and only if its vertex
set V can be partitioned into two nonempty,
disjoint subsets V1 and V2 such that there exists
no edge in G whose one end vertex is in subset V1
and the other in subset V2 .
• Proof: Suppose that such a partitioning exists. Consider two arbitrary
vertices a and b of G, such that a ∈ V1 and b ∈ V2 . No path can exist
between vertices a and b; otherwise, there would be at least one
edge whose one end vertex would be in V1 and the other in V2 .
Hence, if a partition exists, G is not connected.
• Conversely, let G be a disconnected graph. Consider a vertex a in G.
Let V1 be the set of all vertices that are joined by paths to a. Since G is
disconnected, V1 does not include all vertices of G. The remaining
vertices will form a (nonempty) set V2 . No vertex in V1 is joined to
any in V2 by an edge. Hence the partition.
THEOREM 2-2
If a graph (connected or disconnected) has exactly two
vertices of odd degree, there must be a path joining these
two vertices.

• Let G be a graph with all even vertices† except vertices v1 and v2 ,


which are odd.
• From Theorem 1-1, which holds for every graph and therefore for
every component of a disconnected graph, no graph can have an odd
number of odd vertices.
• . Therefore, in graph G, v1 and v2 must belong to the same
component, and hence must have a path between them
THEOREM 2-3
A simple graph (i.e., a graph without parallel edges or self-
loops) with n vertices and k components can have at most (n
− k)(n − k + l)/2 edges.

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