Tubidy
    Vladislav Kabanov, Modification of Fon Der Flaass construction to create divisible design graphs

    Vladislav Kabanov, Modification of Fon Der Flaass construction to create divisible design graphs

    25:57 |
    Download MP3

    Related Videos

    Counting fair dominating sets, Saeid Alikhani 1:10:30

    Counting fair dominating sets, Saeid Alikhani

    Brhane Gebremichel, Non existence of two infinite family of strongly regular graphs 20:46

    Brhane Gebremichel, Non existence of two infinite family of strongly regular graphs

    Maarten De Boeck, Neumaier graphs 57:47

    Maarten De Boeck, Neumaier graphs

    Shaofei Du, On the Burness Giudici conjecture 48:49

    Shaofei Du, On the Burness Giudici conjecture

    Dmitry Panasenko, Vertex connectivity of some classes of divisible design graphs 20:56

    Dmitry Panasenko, Vertex connectivity of some classes of divisible design graphs

    Gareth Jones, Hole operations and Hurwitz maps 50:23

    Gareth Jones, Hole operations and Hurwitz maps

    Shamil Asgarli, The rigidity of maximum cliques in pseudo Paley graphs 1:00:00

    Shamil Asgarli, The rigidity of maximum cliques in pseudo Paley graphs

    Lecture 2. Introduction to the theory of directions 1:11:48

    Lecture 2. Introduction to the theory of directions

    Grigory Ryabov Divisible design graphs from Higmanian association schemes 48:14

    Grigory Ryabov Divisible design graphs from Higmanian association schemes

    Rosemary Bailey, Substitutes for the non-existent square lattice designs for 36 treatments 59:10

    Rosemary Bailey, Substitutes for the non-existent square lattice designs for 36 treatments

    Vladislav Kabanov, Modification of Fon Der Flaass construction to create divisible design graphs 25:57

    Vladislav Kabanov, Modification of Fon Der Flaass construction to create divisible design graphs

    Sergey Goryainov, Tightness of the weight-distribution bound for some strongly regular graphs 31:55

    Sergey Goryainov, Tightness of the weight-distribution bound for some strongly regular graphs

    Josef Lauri, On zero sum or almost zero sum spanning trees of and some related results 47:42

    Josef Lauri, On zero sum or almost zero sum spanning trees of and some related results

    Dmitry Panasenko, More about vertex connectivity of special classes of divisible design graphs 30:58

    Dmitry Panasenko, More about vertex connectivity of special classes of divisible design graphs

    Power domination in graphs A survey, Paul Dorbec 1:01:17

    Power domination in graphs A survey, Paul Dorbec

    Chi Hoi Yip, On the clique number of Paley graphs and generalized Paley graphs 57:51

    Chi Hoi Yip, On the clique number of Paley graphs and generalized Paley graphs

    Total domination polynomial of a graph-A survey 54:13

    Total domination polynomial of a graph-A survey

    Lecture 1. A conjecture by van Lint & MacWilliams and its confirmation by Blokhuis 1:01:12

    Lecture 1. A conjecture by van Lint & MacWilliams and its confirmation by Blokhuis

    Štefan Gyürki, About the Paulus-Rozenfeld-Thompson graph 59:52

    Štefan Gyürki, About the Paulus-Rozenfeld-Thompson graph

    Saeid Alikhani, Counting the number of non equivalent distinguishing coloring A survey 55:41

    Saeid Alikhani, Counting the number of non equivalent distinguishing coloring A survey