CO1:  Analyze  fundamental  graph  structures,  including  subgraphs,  degrees  of  vertices,  paths, connectedness, and automorphisms, to interpret their properties and relationships. (An)

CO2:  Apply  connectivity  concepts,  vertex  and  edge  cuts,  blocks,  and  spanning  trees  to construct and verify graph structures, utilizing Cayley’s formula. (A)

CO3:  Apply  advanced  graph-theoretic  techniques  to  solve  problems  related  to  independent sets, matchings, Eulerian and Hamiltonian graphs, and graph colorings. (A)

CO4:  Apply  planarity  concepts  and  edge  colorings  to  model  and  solve  complex  graph  structure problems. (A)