Results 91 to 100 of about 566 (153)

Grafos de Cayley

open access: yes, 2017
Two of the most relevant branches of modern day Mathematics are Group Theory and Graph Theory. Both theories meet in Cayley digraphs. Cayley digraphs are a new way to observe and represent the structure of a group or of a determined set of groups.
openaire   +1 more source

Grafos em superfícies

open access: yes, 2015
The main goal of this work is to get a result on separation of surfaces by graphs. The Relative Homology is the principal tool used and we get a particular version of Lefschetz duality. For the preparation of this dissertation we studied: graphs, simplicial homology, relative homology and graphs on surfaces.
openaire   +1 more source

The internal structure of handwriting proficiency in beginning writers. [PDF]

open access: yesPLoS One
Truxius L   +3 more
europepmc   +1 more source

Coloraciones de grafos: grafos planos y polinomio cromático

open access: yes
Coloring a graph means assigning “colors” to its vertices so that two adjacent vertices never have the same color. This is a very classical problem because of its relation to, for example, map colorings and the famous Four Color Theorem, but it also has practical applications, for example when you want to divide a set into groups but there are certain ...
openaire   +1 more source

Coloración de grafos

open access: yes, 2000
Estudiamos algunos resultados sobre rama-coloración de grafos y su relación con el teorema del mapa de cuatro colores. A tal fin, se introduce la noción de “coloración” de una conjunto de ramas y se estudian sus propiedades relacionadas con el álgebra de Boole.
openaire   +1 more source

Work and politics in the era of liquid modernity: meanings attributed by female nurses. [PDF]

open access: yesRev Esc Enferm USP
Dias MO   +7 more
europepmc   +1 more source

CLUSTERING SU GRAFO

open access: yesRatio Mathematica, 1992
The present paper deals with the following problem: given a connected graph G with n nodes, partition its set of nodee into p classes such that the subgraph induced by each class is connected and given function, inertia; of the partition is minimized This paper includes : a heuristic algorithm for general graphs based on the solution of a sequence of ...
openaire   +1 more source

Home - About - Disclaimer - Privacy