The number and length distribution of circuits or loops in a graph or network give important insights into its key characteristics. We discuss the circuit properties of various sm...
Circuits and loops in graph systems can be used to model the attractors in gene-regulatory networks. The number of such attractors grows very rapidly with network size and even fo...
- A representation for a set is defined to be symmetric if the space required for the representation of the set is the same as the space required for representation of the set'...
A set S V is a dominating set of a graph G = (V; E) if each vertex in V is either in S or is adjacent to a vertex in S. A vertex is said to dominate itself and all its neighbors. ...
A closure operator for interval order structures has been introduced and its basic properties analysed. The operator is an equivalence of 3-closure operator of [11] for stratified ...