The International Workshop on Optimal Network Topologies (IWONT) provides researchers interested in theoretical problems arising from the design and analysis of interconnections networks with the opportunity to meet and discuss on different topics related to this general subject.

The themes covered by the workshop came mainly from Graph Theory and include the degree-diameter problem and the associated design of large graphs and digraphs; spectral techniques; connectivity and vulnerability; symmetry and regularity in graphs; Cayley graphs; factors and graph decompositions; random graphs and probabilistic methods; permutation networks, and routing and protocols in communication networks.

Collections

  • 3er. 2010 [27]

    Facultat de Matemàtiques i Estadística, Universitat Politècnica de Catalunya, Barcelona, 9-11 June 2010

Recent Submissions

  • Topology of Cayley graphs applied to inverse additive problems 

    Hamidoune, Yahya Ould (Iniciativa Digital Politècnica, 2011)
    Conference report
    Open Access
    We present the basic isopermetric structure theory, obtaining some new simplified proofs. Let 1 ≤ r ≤ k be integers. As an application, we obtain simple descriptions for the subsets S of an abelian group with |kS| ≤ ...
  • Algebraic characterizations of bipartite distance-regular graphs 

    Fiol Mora, Miquel Àngel (Iniciativa Digital Politècnica, 2011)
    Conference report
    Open Access
    Bipartite graphs are combinatorial objects bearing some interesting symmetries. Thus, their spectra—eigenvalues of its adjacency matrix—are symmetric about zero, as the corresponding eigenvectors come into pairs. Moreover, ...
  • A mathematical model for dynamic memory networks 

    Fàbrega Canudas, José; Fiol Mora, Miquel Àngel; Serra Albó, Oriol; Andrés Yebra, José Luis (Iniciativa Digital Politècnica, 2011)
    Conference report
    Open Access
    The aim of this paper is to bring together the work done several years ago by M.A. Fiol and the other authors to formulate a quite general mathematical model for a kind of permutation networks known as dynamic memories. A ...
  • Large Edge-non-vulnerable Graphs 

    Delorme, Charles (Iniciativa Digital Politècnica, 2011)
    Conference report
    Open Access
    In this paper we study the graphs such that the deletion of any edge does not increase the diameter. We give some upper bounds for the order of such a graph with given maximum degree and diameter. On the other hand ...
  • Dual concepts of almost distance-regularity and the spectral excess theorem 

    Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest; Dam, Edwin R. van (Iniciativa Digital Politècnica, 2011)
    Conference report
    Open Access
    Generally speaking, ‘almost distance-regular’ graphs are graphs that share some, but not necessarily all, regularity properties that characterize distance-regular graphs. In this paper we first propose two dual concepts ...
  • Large digraphs of given diameter and degree from coverings 

    Ždímalová, Mária; Staneková, Lubica (Iniciativa Digital Politècnica, 2011)
    Conference report
    Open Access
    We show that a construction of Comellas and Fiol for large vertex-transitive digraphs of given degree and diameter from small digraphs preserves the properties of being a Cayley digraph and being a regular covering.
  • Fiedler’s Clustering on m-dimensional Lattice Graphs 

    Trajanovski, Stojan; Mieghem, Piet Van (Iniciativa Digital Politècnica, 2011)
    Conference report
    Open Access
    We consider the partitioning of m-dimensional lattice graphs using Fiedler’s approach [1], that requires the determination of the eigenvector belonging to the second smallest eigenvalue of the Laplacian. We examine the ...
  • Large graphs of diameter two and given degree 

    Širáň, Jozef; Siagiová, Jana; Ždímalová, Mária (Iniciativa Digital Politècnica, 2011)
    Conference report
    Open Access
    Let r(d, 2), C(d, 2), and AC(d, 2) be the largest order of a regular graph, a Cayley graph, and a Cayley graph of an Abelian group, respectively, of diameter 2 and degree d. The best currently known lower bounds on these ...
  • An overview of the degree/diameter problem for directed, undirected and mixed graphs 

    Miller, Mirka (Iniciativa Digital Politècnica, 2011)
    Conference report
    Open Access
    A well-known fundamental problem in extremal graph theory is the degree/diameter problem, which is to determine the largest (in terms of the number of vertices) graphs or digraphs or mixed graphs of given maximum degree, ...
  • On the k-restricted edge-connectivity of matched sum graphs 

    Marcote Ordax, Francisco Javier (Iniciativa Digital Politècnica, 2011)
    Conference report
    Open Access
    A matched sum graph $G_1$M$G_2$ of two graphs $G_1$ and $G_2$ of the same order n is obtained by adding to the union (or sum) of $G_1$ and $G_2$ a set M of n independent edges which join vertices in V ($G_1$) to vertices ...

View more