Now showing items 1-4 of 4

    • New cyclic Kautz digraphs with optimal diameter 

      Böhmová, Katerina; Dalfó, Cristina; Huemer, Clemens (University of Calgary, 2021-12-31)
      We obtain a new family of digraphs with minimal diameter, that is, given the number of vertices and out-degree, there is no other digraph with a smaller diameter. This new family of digraphs are called `modified cyclic ...
    • On the Laplacian spectra of token graphs 

      Dalfó, Cristina; Duque, F.; Fabila Monroy, R.; Fiol, Miguel Angel; Huemer, Clemens; Zaragoza Martínez, F.J.; Trujillo Negrete, A.L. (Elsevier, 2021)
      We study the Laplacian spectrum of token graphs, also called symmetric powers of graphs. The k-token graph Fk(G) of a graph G is the graph whose vertices are the k-subsets of vertices from G, two of which being adjacent ...
    • The degree/diameter problem in maximal planar bipartite graphs 

      Dalfó, Cristina; Huemer, Clemens; Salas Piñón, Julián (Electronic Journal of Combinatorics, 2016)
      The (∆, D) (degree/diameter) problem consists of finding the largest possiblenumber of verticesnamong all the graphs with maximum degree ∆ and diameter D. We consider the (∆, D) problem for maximal planar bipartite ...
    • The diameter of cyclic Kautz digraphs 

      Böhmová, Katerina; Dalfó, Cristina; Huemer, Clemens (Faculty of Sciences and Mathematics, University of Nis, Serbia, 2017)
      We present a new kind of digraphs, called cyclic Kautz digraphs CK(d, ɭ), which are subdigraphs of the well-known Kautz digraphs K(d,ɭ). The latter have the smallest diameter among all digraphs with their number of ...