Definitions

Question 1

Define Graph

Answer 1

Question 2

Define Loop/Multiple Edges

Answer 2

Question 3

Define Simple Graph

Answer 3

Question 4

Define Adjacent/Incident

Answer 4

Question 5

Define Neighbourhood/Degree

Answer 5

Question 6

Define Isolated Vertex/Pendant

Answer 6

Question 7

Define Adjacency Table

Answer 7

Question 8

Define Adjacency Matrix

Answer 8

Question 9

Define Isomorphic Graphs

Answer 9

Question 10

Define Unlabelled Graph

Answer 10

Question 11

Define Subgraph

Answer 11

Question 12

Define Graph Operations

Answer 12

Question 13

Define Different Subgraphs

Answer 13

Question 14

Define Paths (Graph)

Answer 14

Question 15

Define Cycles

Answer 15

Question 16

Define Complete Graph

Answer 16

Question 17

Define Empty Graph

Answer 17

Question 18

Define Bipartite

Answer 18

Question 19

Define Degree Sequence

Answer 19

Question 20

Define d-regular

Answer 20

Question 21

Define Walk/Path

Answer 21

Question 22

Define Closed Walk/Cycle

Answer 22

Question 23

Define Length of Path

Answer 23

Question 24

Define Connected/Connected Components

Answer 24

Question 25

Define Trail/Eulerian/Semi-Eulerian

Answer 25

Question 26

Define Hamiltonian/Semi-Hamiltonian

Answer 26

Question 27

Define Acyclic/Forest/Tree/Leaf

Answer 27

Question 28

Define Cut-Edge

Answer 28

Question 29

Define Spanning Tree

Answer 29

Question 30

Define The Prufer Code

Answer 30

Question 31

Define Matching/Perfect

Answer 31

Question 32

Define Maximal/Maximum Matching

Answer 32

Question 33

Define Alternating Path

Answer 33

Question 34

Define Matches/Neighbourhood of S

Answer 34