Identificador persistente para citar o vincular este elemento: http://hdl.handle.net/10553/44515
Título: Edges, chains, shadows, neighbors and subgraphs in the intrinsic order graph
Autores/as: Gonźalez, Luis 
Clasificación UNESCO: 12 Matemáticas
Palabras clave: Complex stochastic Boolean system
Edges
Intrinsic order graph
Neighbors
Shadows, et al.
Fecha de publicación: 2012
Proyectos: Avances en Simulación de Campos de Viento y Radiación Solar. 
Publicación seriada: IAENG International Journal of Applied Mathematics 
Resumen: Many different scientific, technical or social phenomena can be modeled by a complex system depending on a large number n of random Boolean variables. Such systems are called complex stochastic Boolean systems (CSBSs). The most useful representation of a CSBS is the intrinsic order graph. This is a symmetric digraph on 2 n nodes, with a characteristic fractal structure. In this paper, different properties of the intrinsic order graph are studied, namely those dealing with its edges; chains; shadows, neighbors and degrees of its vertices; and some relevant subgraphs, as well as the natural isomorphisms between them.
URI: http://hdl.handle.net/10553/44515
ISSN: 1992-9978
Fuente: IAENG International Journal of Applied Mathematics [ISSN 1992-9978],v. 42 (1), p. 66-73
Colección:Artículos
Vista completa

Google ScholarTM

Verifica


Comparte



Exporta metadatos



Los elementos en ULPGC accedaCRIS están protegidos por derechos de autor con todos los derechos reservados, a menos que se indique lo contrario.