Buscar
Mostrando ítems 1-10 de 25
Escalonabilidad de grafos e hipergrafos simples que contienen vértices simpliciales.
(2013-08-09)
En este trabajo estudiamos la escalonabilidad de grafos e hipergrafos simples que contienen al menos un vértice simplicial. Se dan caracterizaciones de los grafos e hipergrafos simples escalonables obtenidas a partir de ...
Evaluation algorithm for a decomposed simplicial piecewiselinear formulation
(journal of Applied Research and Technology, 2008)
Evaluation algorithm for a decomposed simplicial piecewiselinear formulation
(journal of Applied Research and Technology, 2008)
The non-pure version of the simplex and the boundary of the simplex
(Elsevier Science, 2016-08)
We introduce the non-pure versions of simplicial balls and spheres with minimum number of vertices. These are a special type of non-homogeneous balls and spheres (NH-balls and NH-spheres) satisfying a minimality condition ...
THE MODULE OF DERIVATIONS OF A STANLEY-REISNER RING
(Amer Mathematical SocProvidence, 1995)
Special eccentric vertices for the class of chordal graphs and related classes
(Springer Tokyo, 2014-03)
A vertex is simplicial if the vertices of its neighborhood are pairwise adjacent. It is known that, for every vertex v of a chordal graph, there exists a simplicial vertex among the vertices at maximum distance from v. ...
Vértices simpliciales y escalonabilidad de grafos
(Instituto Politécnico Nacional, Centro de Investigación y de Estudios Avanzados, Departamento de MatemáticasÁlgebra U de ACiudad de México, México, 2022)
Motivic constructions on graphs and networks with stability results
(Universidade Estadual Paulista (Unesp), 2020-03-19)
Neste trabalho estudamos certos funtores sobre grafos, chamados de representáveis ou motívicos. Esses funtores não mudam os vértices de um grafo, mas apenas suas setas (as arestas direcionadas). Quaisquer tais funtores ...