International Workshop on Optimal Network Topologies (IWONT)
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 degreediameter 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, 911 June 2010
Recent Submissions

Topology of Cayley graphs applied to inverse additive problems
(2011)
Conference report
Open AccessWe 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 distanceregular graphs
(2011)
Conference report
Open AccessBipartite 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
(2011)
Conference report
Open AccessThe 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 Edgenonvulnerable Graphs
(2011)
Conference report
Open AccessIn 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 distanceregularity and the spectral excess theorem
(2011)
Conference report
Open AccessGenerally speaking, ‘almost distanceregular’ graphs are graphs that share some, but not necessarily all, regularity properties that characterize distanceregular graphs. In this paper we first propose two dual concepts ... 
Large digraphs of given diameter and degree from coverings
(2011)
Conference report
Open AccessWe show that a construction of Comellas and Fiol for large vertextransitive 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 mdimensional Lattice Graphs
(2011)
Conference report
Open AccessWe consider the partitioning of mdimensional 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
(2011)
Conference report
Open AccessLet 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
(2011)
Conference report
Open AccessA wellknown 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 krestricted edgeconnectivity of matched sum graphs
(2011)
Conference report
Open AccessA 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 ... 
Application layer multicast algorithm
(2011)
Conference report
Open AccessThis paper presents a multicast algorithm, called MSMs, for pointtomultipoint transmissions. The algorithm, which has complexity O(n2) in respect of the number n of nodes, is easy to implement and can actually be applied ... 
Radially Moore graphs of radius three and large odd degree
(2011)
Conference report
Open AccessExtremal graphs which are close related to Moore graphs have been defined in different ways. Radially Moore graphs are one of these examples of extremal graphs. Although it is proved that radially Moore graphs exist for ...