Exploració per tema "05C Graph theory"
Ara es mostren els items 4-14 de 14
-
Caracterizaciones combinatorias y algebraicas de grafos distancia-regulares
(Universitat Rovira i Virgili, 2014)
Text en actes de congrés
Accés obertLos grafos distancia-regulares aparecen a menudo en el estudio de es- tructuras matemáticas con un alto grado de simetría y/o regularidad. Un ejemplo bien conocido de tales grafos son los esqueletos ... -
Connectivity: properties and structure
(CRC Press Taylor & Francis Group, 2013-12-05)
Capítol de llibre
Accés obertConnectivity is one of the central concepts of graph theory, from both a theoret- ical and a practical point of view. Its theoretical implications are mainly based on the existence of nice max-min characterization results, ... -
Cycle codes of graphs and MDS array codes
(2009-07-30)
Article
Accés restringit per política de l'editorialWe investigate how to colour edges of graph so that any two colours make up a spanning tree. This problem is equivalent to transforming the cycle code of a graph into a Maximum Distance Separable (MDS) array code. Adopting ... -
Decomposing almost complete graphs by random trees
(2015-04-14)
Report de recerca
Accés obert -
Decomposing almost complete graphs by random trees
(2014)
Text en actes de congrés
Accés restringit per política de l'editorialAn old conjecture of Ringel states that every tree with m edges decom- poses the complete graph K 2 m +1 . A more general version of the Ringel’s conjecture says that every tree with m edges decomposes K rm +1 for each r ... -
Further topics in connectivity
(CRC Press Taylor & Francis Group, 2013-12-05)
Capítol de llibre
Accés obertContinuing the study of connectivity, initiated in §4.1 of the Handbook, we survey here some (sufficient) conditions under which a graph or digraph has a given connectivity or edge-connectivity. First, we describe results ... -
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 ...