Representation of Graphs in Discrete Mathematics - Incident, Path, and Adjacency Matrix
Sundeep Saradhi Kanthety via YouTube
Learn Excel & Financial Modeling the Way Finance Teams Actually Use Them
Free courses from frontend to fullstack and AI
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Learn about graph representation methods in discrete mathematics through a 19-minute educational video covering incident matrices, path matrices, and adjacency matrices. Explore fundamental concepts of discrete mathematical structures including normal forms (elementary sums and products, CNF and DNF), propositional logic (atomic and compound propositions), and essential logical connectives like negation, conjunction, disjunction, conditional statements, bi-conditional statements, exclusive disjunction, NAND, and NOR operations.
Syllabus
Representation of Graphs in Discrete Mathematics || Incident || Path || Adjacency Matrix || DMS
Taught by
Sundeep Saradhi Kanthety