The discussion focuses on obtaining definitions for two specific graph types: simple graphs and connected graphs. A simple graph is defined as an undirected graph that contains no loops or multiple edges between the same two vertices. A connected graph is defined as a graph where all vertex points are interconnected by at least one path. These definitions are essential for understanding basic graph theory concepts relevant for examinations.
PREREQUISITESStudents preparing for exams in mathematics or computer science, educators teaching graph theory, and anyone interested in foundational concepts of graph structures.
terryfields said:just need 2 definitions without proof for an exam tomorrow, don't need to use them for anything just need to be able to quote them but can't find them anyway so if someone could helpfully write them down that would be great
1)simple graph
2)connected graph
cheers