Все публикации

0:13:55

Video_117: A nonempty graph is bicolourable 2 chromatic if and only if is bipartite

0:19:11

Video_116: A graph is bicolourable 2 chromatic if and only if it has no odd cycles

0:14:03

Video_115: Any Tree is 2 chromatic

0:38:58

Video_114: Vertex Colouring and Chromatic Number of a Graph

0:12:06

Video_113: Determining the distances between different pairs of vertices

0:17:06

Video_112: An observation about connectedness and adjacency matrix

0:24:15

Video_111 Powers of the Adjacency Matrix

0:20:28

Video_110: Traces of the Adjacency Matrix of a Graph

0:30:35

Video_109: Squares and Cubes of the Adjacency Matrix

0:14:38

Video_108 Adjacency Matrix of a Graph

0:40:48

Video_107: Relation between incidence and path matrix of a graph

0:11:37

Video_106: Path Matrix of a Graph

0:29:11

Video_105: Relations among Reduced Incidence, Fundamental Cycle and Fundamental Cut set Matrices

0:22:31

Video_104: Rank of the cut set Matrix of a Graph

0:18:28

Video_103: Cut Set Matrix and Fundamental Cut Set Matrix of a Graph

0:33:34

Video_102: Rank of the Cycle Matrix of a Graph

0:10:15

Video_101: Fundamental Cycle Matrix of a Graph.

0:34:12

Video_100: Relationship between the Incidence Matrix and the Cycle Matrix of a Graph

0:24:26

Video_99: Cycle (Circuit) Matrix of a Graph and its properties

0:26:45

Video_98: Sub-matrices of the Incidence Matrix and a property of it

0:20:25

Video_97: Reduced Incidence Matrix of a Graph

0:22:16

Video_96: Rank of the incidence matrix

0:20:58

Video_95: Incidence Matrix of a Graph

0:10:59

Video_94: A connected plane graph is bipartite if and only if its dual graph Eulerian.