Representation of Graphs in Discrete Mathematics - Incident, Path, and Adjacency Matrix
Sundeep Saradhi Kanthety via YouTube
AI, Data Science & Cloud Certificates from Google, IBM & Meta
Get 20% off all career paths from fullstack to AI
Overview
AI, Data Science & Cloud Certificates from Google, IBM & Meta — 40% Off
One plan covers every Professional Certificate on Coursera. 40% off Coursera Plus Annual.
Unlock All Certificates
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