Tubidy
    Vladislav Kabanov, New constructions of strongly regular graphs based on divisible design graphs

    Vladislav Kabanov, New constructions of strongly regular graphs based on divisible design graphs

    41:53 |
    Download MP3

    Related Videos

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

    Counting fair dominating sets, Saeid Alikhani

    Maarten De Boeck, Neumaier graphs 57:47

    Maarten De Boeck, Neumaier graphs

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

    Power domination in graphs A survey, Paul Dorbec

    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

    Shaofei Du, On the Burness Giudici conjecture 48:49

    Shaofei Du, On the Burness Giudici conjecture

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

    Lecture 2. Introduction to the theory of directions

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

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

    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

    Nikolay Minigulov, On finite groups which Gruenberg-Kegel graphs are isomorphic to the paw 30:13

    Nikolay Minigulov, On finite groups which Gruenberg-Kegel graphs are isomorphic to the paw

    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

    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

    Ivan Mogilnykh, On the minimum distances of codes from the inclusion matrices of 2 subsets vs k sub 25:51

    Ivan Mogilnykh, On the minimum distances of codes from the inclusion matrices of 2 subsets vs k sub

    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

    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

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

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

    Artem Kravchuk, Spectrum of the Transposition graph 27:07

    Artem Kravchuk, Spectrum of the Transposition graph

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

    Total domination polynomial of a graph-A survey

    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

    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

    Natalia Maslova, On recognition of a finite group by its Gruenberg-Kegel graph 55:29

    Natalia Maslova, On recognition of a finite group by its Gruenberg-Kegel graph