Exploració per tema "diameter"
Ara es mostren els items 1-20 de 22
-
A geometric approach to dense Cayley digraphs of finite Abelian groups
(Elsevier, 2016)
Text en actes de congrés
Accés obertWe give a method for constructing infinite families of dense (or eventually likely dense) Cayley digraphs of finite Abelian groups. The diameter of the digraphs is obtained by means of the related {\em minimum distance ... -
A geometric approach to dense Cayley digraphs of finite Abelian groups
(2016)
Article
Accés obertWe give a method for constructing infinite families of dense (or eventually likely dense) Cayley digraphs of finite Abelian groups. The diameter of the digraphs is obtained by means of the related minimum distance diagrams. ... -
Bipartite biregular Moore graphs
(2021-11)
Article
Accés obertA bipartite graph G = (V, E) with V = V1 ¿ V2 is biregular if all the vertices of a stable set Vi have the same degree ri for i = 1, 2. In this paper, we give an improved new Moore bound for an infinite family of such ... -
Comments on “Extremal Cayley Digraphs of Finite Abelian Groups” [Intercon. Networks 12 (2011), no. 1-2, 125–135]
(2013-12)
Article
Accés obertWe comment on the paper “Extremal Cayley digraphs of finite Abelian groups” [Intercon. Networks 12 (2011), no. 1-2, 125–135]. In particular, we give some counterexamples to the results presented there, and provide a correct ... -
Computing optimal shortcuts for networks
(2018)
Text en actes de congrés
Accés obertWe study augmenting a plane Euclidean network with a segment, called shortcut, to minimize the largest distance between any two points along the edges of the resulting network. Questions of this type have received considerable ... -
Deterministic hierarchical networks
(2006)
Article
Accés obertIt has recently been shown that many networks associated with complex systems are small-world (they have both a large local clustering and a small average distance and diameter) and they are also scale-free (the degrees ... -
Deterministic hierarchical networks
(2016)
Article
Accés obertIt has been shown that many networks associated with complex systems are small-world (they have both a large local clustering coefficient and a small diameter) and also scale-free (the degrees are distributed according ... -
Deterministic hierarchical networks
(2007-11-20)
Article
Accés obertRecently it has been shown that many networks associated with complex systems are small-world (they have both a large local clustering and a small diameter) and they are also scale-free (the degrees are distributed according ... -
Extremal graph theory for metric dimension and diameter
(2010-02-22)
Article
Accés obertA set of vertices S resolves a connected graph G if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of G is the minimum cardinality of a resolving set of G. Let ... -
Fast, exact graph diameter computation with vertex programming
(Barcelona Supercomputing Center, 2015)
Text en actes de congrés
Accés obertIn graph theory the diameter is an important topological metric for understanding size and density of a graph. Unfortunately, the graph diameter is computationally di cult to measure for even moderately-sized graphs, ... -
Modelo elíptico para la sección de hilo. Parte 2: la predicción y el ajuste de un modelo elíptico para hilados de algodón del rotor (OE)
(2007)
Article
Accés obertUn parámetro importante de la tecnología textil es la geometría de la estructura del hilo. Este parámetro se ve afectado por el de sistema de hilatura utilizado. En el proceso de hilatura se puede modificar el diámetro de ... -
Modelo elíptico para la sección de hilo. Parte 3: Predicción de un modelo elíptico para hilados vortex (VS) de algodón
(INTEXTER, 2008)
Article
Accés obertLa geometría estructural del hilo depende del sistema de hilatura utilizado. Los principales parámetros que se ven afectados son: el volumen especifico, el diámetro de la sección del hilado y la deformación de la sección ... -
Notes on betweenness centrality of a graph
(2009-05-19)
Report de recerca
Accés obertThe betweenness centrality of a vertex of a graph is the portion of shortest paths between all pairs of vertices passing through that vertex. We study selected general properties of this invariant and its relations to ... -
On the relation between graph distance and Euclidean distance in random geometric graphs
(2016-09-01)
Article
Accés obertGiven any two vertices u, v of a random geometric graph G(n, r), denote by dE(u, v) their Euclidean distance and by dE(u, v) their graph distance. The problem of finding upper bounds on dG(u, v) conditional on dE(u, v) ... -
Optimization of blend parameters for the fabrication of polycaprolactone-silicon based ormoglass nanofibers by electrospinning
(2015-08-01)
Article
Accés obertElectrospinning is a method that can be used to efficiently produce scaffolds that mimic the fibrous structure of natural tissue, such as muscle structures or the extracellular matrix of bone. The technique is often used ... -
Particiones equilibradas de grafos geométricos
(Universitat Politècnica de Catalunya, 2022-01-24)
Treball Final de Grau
Accés obertEn ciertas aplicaciones geométricas, modelar el problema usando grafos geométricos puede ofrecer mejores resultados y respuestas que los enfoques habituales. Los objetivos de este proyecto son diseñar e implementar algoritmos ... -
The betweenness centrality of a graph
(2007-05-10)
Article
Accés obertA measure of the centrality of a vertex of a graph is the portion of shortest paths crossing through it between other vertices of the graph. This is called betweenness centrality and here we study some of its general ... -
The diameter of cyclic Kautz digraphs
(2017)
Article
Accés obertWe 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 vertices ... -
The diameter of cyclic Kautz digraphs
(2015-11-12)
Article
Accés obertA prominent problem in Graph Theory is to find extremal graphs or digraphs with restrictions in their diameter, degree and number of vertices. Here we obtain a new family of digraphs with minimal diameter, that is, given ... -
The diameter of the directed configuration model
(2023-02-01)
Article
Accés obertWe show that the diameter of the directed configuration model with n vertices rescaled by log n converges in probability to a constant. Our assumptions are the convergence of the in- and out-degree of a uniform random ...
