Exploració per tema "05C Graph theory"
Ara es mostren els items 10-14 de 14
-
On the algebraic theory of pseudo-distance-regulariry around a set
(Elsevier, 1999-09)
Article
Accés restringit per política de l'editorialLet C be a connected graph with vertex set V, adjacency matrix A, positive eigenvector and corresponding eigenvalue 0. A natural generalization of distance-regularity around a vertex subset C V , which makes sense ... -
On the generalitzed arc routing problem
(2013)
Text en actes de congrés
Accés obert -
Some results on the structure of multipoles in the study of snarks
(2015-02-25)
Article
Accés obertMultipoles are the pieces we obtain by cutting some edges of a cubic graph in one or more points. As a result of the cut, a multipole M has vertices attached to a dangling edge with one free end, and isolated edges with ... -
The Maximum degree of series-parallel graphs
(2011-07)
Article
Accés restringit per acord de confidencialitatWe prove that the maximum degree Δn of a random series-parallel graph with n vertices satisfies Δn/ log n → c in probability, and EΔn ∼ c log n for a computable constant c > 0. The same kind of result holds for 2-connected ... -
Una fórmula explícita para obtener cuadrángulos generalizados y otros grafos pequeños de cintura 8
(Universidad de Almería, 2011)
Text en actes de congrés
Accés obertPara cada potencia de primo q, se han constru do (q+1; 8)-jaulas como super cies cu adricas no degeneradas en 4-espacios proyectivos P(4; q). En primer lugar presentamos una construcci on de estos grafos de un modo ...