A graph-theoretic method to define any Boolean operation on partitions
نویسندگان
چکیده
منابع مشابه
Observability of Boolean networks: A graph-theoretic approach
Boolean networks (BNs) are discrete-time dynamical systems with Boolean state-variables and outputs. BNs are recently attracting considerable interest as computational models for genetic and cellular networks. We consider the observability of BNs, that is, the possibility of uniquely determining the initial state given a time sequence of outputs. Our main result is that determining whether a BN...
متن کاملA Graph-Theoretic Method to Representing a Concept Lattice
Concept lattices are indeed lattices. In this paper, we present a new relationship between lattices and graphs: given a binary relation I, we define an underlying graph DI , and find out the constitution in the set of cover elements of the minimum element of the concept lattice of I using the properties of DI . The following is to provide a way to establish a one-to-one correspondence between t...
متن کاملA module theoretic approach to zero-divisor graph with respect to (first) dual
Let $M$ be an $R$-module and $0 neq fin M^*={rm Hom}(M,R)$. We associate an undirected graph $gf$ to $M$ in which non-zero elements $x$ and $y$ of $M$ are adjacent provided that $xf(y)=0$ or $yf(x)=0$. Weobserve that over a commutative ring $R$, $gf$ is connected anddiam$(gf)leq 3$. Moreover, if $Gamma (M)$ contains a cycle,then $mbox{gr}(gf)leq 4$. Furthermore if $|gf|geq 1$, then$gf$ is finit...
متن کاملOn Connected Bi-partitions of a Graph
We explore the connected bi-partitions of a graph i.e. spanning subgraphs of a graph which consist of exactly two connected components. We then relate the bi-partitions to the elements of the Moore-Penrose pseudoinverse of the graph Laplacian (L). Moreover, we establish a topological interpretation for the effective resistance metric and the so called Kirchoff index for the graph in terms of th...
متن کاملA generalization of Schönemann's theorem via a graph theoretic method
Recently, Grynkiewicz et al. [Israel J. Math. 193 (2013), 359–398], using tools from additive combinatorics and group theory, proved necessary and sufficient conditions under which the linear congruence a1x1+ · · ·+akxk ≡ b (mod n), where a1, . . . , ak, b, n (n ≥ 1) are arbitrary integers, has a solution 〈x1, . . . , xk〉 ∈ Z k n with all xi distinct modulo n. So, it would be an interesting pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Art of Discrete and Applied Mathematics
سال: 2019
ISSN: 2590-9770
DOI: 10.26493/2590-9770.1259.9d5