algebraic graph theory: efficient (j,k)-domination
Published 3 years ago • 912 plays • Length 55:03Download video MP4
Download video MP3
Similar videos
-
1:03:17
algebraic graph theory: leonard pairs, spin models, and distance-regular graphs
-
49:34
algebraic graph theory: strongly cospectral vertices, cayley graphs and other things
-
56:16
algebraic graph theory: cospectral vertices and isospectral reductions
-
48:07
algebraic graph theory: instantaneous uniform mixing:
-
39:31
algebraic graph theory: pseuodrandom cliquefree graphs, finite geometry, and spectra
-
42:25
algebraic graph theory: distinct eigenvalues and sensitivity
-
10:33
marius jurgelėnas - algebraic data types
-
59:01
michael henning - upper bounds on (total) domination numbers of a graph in terms of minimum degree
-
21:15
algebraic graph theory lecture 001
-
49:27
algebraic graph theory: an algebraic framework for twualities of embedded graphs
-
45:19
algebraic graph theory: fractional revival on graphs
-
51:02
algebraic graph theory: laplacian quantum fractional revival on graphs
-
1:00:30
algebraic graph theory: k-fractional revival and approximate k-fractional revival on path graphs
-
1:02:51
algebraic graph theory: variants of the erdős-ko-rado problem
-
14:06
dan spielman combinatorics and complexity public talk
-
1:08:21
algebraic graph theory: quantum isomorphisms-- results and open questions
-
55:41
algebraic graph theory: balancedly splittable orthogonal designs
-
52:55
algebraic graph theory: why are hoffman's bounds for alpha and chi truly duals of each other?
-
56:06
algebraic graph theory: the matching polynomial
-
58:24
algebraic graph theory: quantum mixing through the algorithmic lens