Please use this identifier to cite or link to this item: http://hdl.handle.net/10553/44515
Title: Edges, chains, shadows, neighbors and subgraphs in the intrinsic order graph
Authors: Gonźalez, Luis 
UNESCO Clasification: 12 Matemáticas
Keywords: Complex stochastic Boolean system
Edges
Intrinsic order graph
Neighbors
Shadows
Subgraphs
Issue Date: 2012
Project: Avances en Simulación de Campos de Viento y Radiación Solar. 
Journal: IAENG International Journal of Applied Mathematics 
Abstract: 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
Source: IAENG International Journal of Applied Mathematics [ISSN 1992-9978],v. 42 (1), p. 66-73
Appears in Collections:Artículos
Show full item record

SCOPUSTM   
Citations

6
checked on Aug 9, 2020

Page view(s)

4
checked on Aug 8, 2020

Google ScholarTM

Check


Share



Export metadata



Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.