What is the difference between pendant vertex and isolated vertex
Answers
Answered by
2
Hope it helps..........
Attachments:
Answered by
2
Isolated Vertices, Leaves, and Pendant Edges
Fold
Table of Contents
Isolated Vertices, Leaves, and Pendant Edges
Isolated Vertices
Leaves
Pendant Edge
Isolated Vertices, Leaves, and Pendant Edges
Isolated Vertices
Definition: For a graph G=(V(G),E(G)), a vertex x1∈V(G) is considered Isolated if deg(x1)=0.
For example, the following graph has one isolated vertex:
Screen%20Shot%202014-02-18%20at%207.25.07%20PM.png
Note that if a graph has an isolated vertex, then the graph is disconnected.
Leaves
Definition: For a graph G=(V(G),E(G)), a vertex x1∈V(G) is considered a Leaf if deg(x1)=1.
For example, the following graph has one leaf, namely the vertex labelled "1":
Screen%20Shot%202014-02-18%20at%207.27.20%20PM.png
Pendant Edge
Definition: For a graph G=(V(G),E(G)), an edge connecting a leaf is called a Pendant Edge.
From the example earlier, we can highlight the pendant edge of the graph:
Screen%20Shot%202014-02-18%20at%207.29.07%20PM.png
Fold
Table of Contents
Isolated Vertices, Leaves, and Pendant Edges
Isolated Vertices
Leaves
Pendant Edge
Isolated Vertices, Leaves, and Pendant Edges
Isolated Vertices
Definition: For a graph G=(V(G),E(G)), a vertex x1∈V(G) is considered Isolated if deg(x1)=0.
For example, the following graph has one isolated vertex:
Screen%20Shot%202014-02-18%20at%207.25.07%20PM.png
Note that if a graph has an isolated vertex, then the graph is disconnected.
Leaves
Definition: For a graph G=(V(G),E(G)), a vertex x1∈V(G) is considered a Leaf if deg(x1)=1.
For example, the following graph has one leaf, namely the vertex labelled "1":
Screen%20Shot%202014-02-18%20at%207.27.20%20PM.png
Pendant Edge
Definition: For a graph G=(V(G),E(G)), an edge connecting a leaf is called a Pendant Edge.
From the example earlier, we can highlight the pendant edge of the graph:
Screen%20Shot%202014-02-18%20at%207.29.07%20PM.png
Similar questions