Exploració per tema "Diameter"
Ara es mostren els items 1-14 de 14
-
A new general family of mixed graphs
(2019-01-11)
Article
Accés obertA new general family of mixed graphs is presented, which generalizes both the pancake graphs and the cycle prefix digraphs. The obtained graphs are vertex transitive and, for some values of the parameters, they constitute ... -
Calculando shortcuts óptimos en redes Euclidianas planares
(Universitat Politècnica de Catalunya, 2022-04-29)
Treball Final de Grau
Accés obertEstudiem augmentar una xarxa Euclidiana planar amb un segment, anomenat shortcut, per a minimitzar la major distància entre dos punts al llarg de les arestes de la xarxa resultant. Els problemes d'aquest tipus han rebut ... -
Celebrity games
(2016-10-04)
Article
Accés obertWe introduce Celebrity games, a new model of network creation games. In this model players have weights (W being the sum of all the player's weights) and there is a critical distance ß as well as a link cost a. The cost ... -
Cospectral digraphs from locally line digraphs
(Elsevier, 2016-07-01)
Article
Accés obertA digraph Gamma = (V, E) is a line digraph when every pair of vertices u, v is an element of V have either equal or disjoint in -neighborhoods. When this condition only applies for vertices in a given subset (with at least ... -
Diseño de una pinza de freno radial de desgaste homogéneo
(Universitat Politècnica de Catalunya, 2018-02)
Treball Final de Grau
Accés restringit per decisió de l'autor[CASTELLÀ] El sistema de frenos de un vehículo es de vital importancia, ya que es el encargado de detener el vehículo. A medida que va pasando el tiempo se van investigando mejoras en las pinzas de freno para que sean más ... -
Distance-uniform graphs with large diameter
(2019-06-01)
Article
Accés obertAn ϵ-distance-uniform graph is one with a critical distance d such that from every vertex, all but at most an ϵ-fraction of the remaining vertices are at distance exactly d. Motivated by the theory of network creation ... -
From subkautz digraphs to cyclic kautz digraphs
(2018-06-01)
Article
Accés obertKautz digraphs K(d,l) are a well-known family of dense digraphs, widely studied as a good model for interconnection networks. Closely related with these, the cyclic Kautz digraphs CK(d,l) were recently introduced by Böhmová, ... -
General properties of c-circulant digraphs
(1988)
Article
Accés obertA digraph is said to be a c-circulant if its adjacency matrix is c-circulant. This paper deals with general properties of this family of digraphs, as isomorphisms, regularity, strong connectivity, diameter and the relation ... -
New cyclic Kautz digraphs with optimal diameter
(2021)
Article
Accés obertWe 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 bipartite sum basic equilibria
(Springer, 2021)
Text en actes de congrés
Accés obertA connected and undirected graph G of size n≥1 is said to be a sum basic equilibrium iff for every edge uv from G and any node v′ from G, when performing the swap of the edge uv for the edge uv′ the sum of the ... -
On bipartite-mixed graphs
(Wiley, 2018-04-24)
Article
Accés obertMixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are bipartite. As main results, we show that in this context ... -
Sequence mixed graphs
(2016-12)
Article
Accés obertA mixed graph can be seen as a type of digraph containing some edges (or two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and literated line ... -
The generalized hierarchical product of graphs
(2008-01)
Article
Accés obertA generalization of both the hierarchical product and the Cartesian product of graphs is introduced and some of its properties are studied. We call it the generalized hierarchical product. In fact, the obtained graphs ... -
The hierarchical product of graphs
(2007)
Article
Accés obertA new operation on graphs is introduced and some of its properties are studied. We call it hierarchical product, because of the strong (connectedness) hierarchy of the vertices in the resulting graphs. In fact, the ...