6120a Discrete Mathematics And Proof For Computer Science Fix -

However based on general Discrete Mathematics concepts here some possible fixes:

A graph is a pair $G = (V, E)$, where $V$ is a set of nodes and $E$ is a set of edges. However based on general Discrete Mathematics concepts here

Propositional logic is a branch of logic that deals with statements that can be either true or false. Propositional logic is used extensively in computer science, as it provides a formal framework for reasoning about Boolean expressions and logical statements. However based on general Discrete Mathematics concepts here