Now showing items 1-2 of 2

    • Thumbnail

      Feasibility of distance-regular graphs 

      Collection: Theses (Ph.D) - Mathematics ดุษฎีนิพนธ์ - คณิตศาสตร์
      Type: Thesis
      สุภลักษณ์ สุมาลย์โรจน์ (Silpakorn University, 12/7/2019)
       The problem of deciding whether a distance-regular graph with a given intersection array exists is a widely studied topic in distance-regular graphs.  In 1989 Brouwer, Cohen and Neumaier have compiled a list of intersection ...
    • Thumbnail

      Merging in bipartite distance-regular graphs 

      Collection: Theses (Ph.D) - Mathematics ดุษฎีนิพนธ์ - คณิตศาสตร์
      Type: Thesis
      ศิวพร มามาตร (Silpakorn University, 12/6/2020)
      Merging the first and third classes in a connected graph is the operation of adding edges between all vertices at distance 3 in the original graph while keeping the original edges.Merging the first m classes in a connected ...


      Copyright  ©  2021 Silpakorn University Central Library All Rights Reserved.
      Theme by 
      Atmire NV