Exploració per autor "Lladó Sánchez, Ana M."
Ara es mostren els items 11-21 de 21
-
Matemática discreta
(Edicions UPC, 2001)
Llibre
Accés restringit a la comunitat UPCLa matemàtica discreta és la part de les matemàtiques que tracta de les estructures finites i numerables. Aquesta nova branca de les matemàtiques ha rebut un impuls decisiu amb els progressos de la informàtica i de les ... -
On star forest ascending subgraph decomposition
(2017-02-03)
Article
Accés obertThe Ascending Subgraph Decomposition (ASD) Conjecture asserts that every graph G with (n+12) edges admits an edge decomposition G=H1¿¿¿Hn such that Hi has i edges and it is isomorphic to a subgraph of Hi+1, i=1,…,n-1. We ... -
On star-forest ascending subgraph decomposition
(2015-04-14)
Report de recerca
Accés obert -
On the ascending subgraph decomposition problem for bipartite graphs
(2014-09)
Article
Accés obertThe Ascending Subgraph Decomposition (ASD) Conjecture asserts that every graph G with View the MathML source(n+12) edges admits an edge decomposition G=H1¿¿¿HnG=H1¿¿¿Hn such that HiHi has i edges and is isomorphic to ... -
On the ASD conjecture
(2010)
Text en actes de congrés
Accés restringit per política de l'editorialLet G be a graph of size ($\displaystyle\frac{n+1}{2}$) for some integer n ≥ 1. G is said to have an ascending subgraph decomposition (ASD) if can be decomposed into n subgraphs H1, . . . ,Hn such that Hi has i edges and ... -
Partición de un conjunto de enteros con sumas prescritas
(2008)
Text en actes de congrés
Accés restringit per política de l'editorialSea X un conjunto de n enteros y M = {m1 ≥ · · · ≥ mk} una secuencia de enteros positivos. El problema consiste en encontrar una partici´on de X en k subconjuntos mutuamente disjuntos X1, . . . ,Xk tal que la suma de los ... -
Sèries de Fourier : notes de classe
(Universitat Politècnica de Catalunya, 2012-02)
Apunts
Accés obert -
The partial line digraph technique in the design of large interconnection networks
(1992-07)
Article
Accés restringit per política de l'editorialThe following problem arises in the design of some interconnection networks for distributed systems. Namely, to construct digraphs with given maximum out-degree, reduced diameter, easy routing, good connectivity, and ... -
Transformada de Fourier : notes de classe
(Universitat Politècnica de Catalunya, 2012-03)
Apunts
Accés obert -
Vertex-transitive graphs that remain connected after failure of a vertex an its neighbors
(Wiley InterScience, 2010)
Article
Accés restringit per política de l'editorialA d-regular graph is said to be superconnected if any disconnecting subset with cardinality at most d is formed by the neighbors of some vertex. A superconnected graph that remains connected after the failure of a vertex ... -
Vertex-Transitive Graphs That Remain Connected After Failure of a Vertex and Its Neighbors
(Wiley InterScience, 2011-06)
Article
Accés restringit per política de l'editorialA d-regular graph is said to be superconnected if any disconnecting subset with cardinality at most d is formed by the neighbors of some vertex. A superconnected graph that remains connected after the failure of a vertex ...
