Halaš and Jukl associated the zero-divisor graph G to a poset (X,≤) with zero by declaring two distinct elements x and y of X to be adjacent if and only if there is no non-zero lower bound for {x, y}. We characterize all the graphs that can be realized as the zero-divisor graph of a poset. Using this, we classify posets whose zero-divisor graphs are the same. In particular we show that if V is an n-element set, then there exist $\begin{array}{} \sum\limits_{\log_2(n+1)\leq k\leq n}^{}\binom{n}{k}\binom{2^k-k-1}{n-k} \end{array} $ reduced zero-divisor graphs whose vertex sets are V.
Let G be a simple undirected graph with each vertex colored either white or black, u be a black vertex of G, and exactly one neighbor v of u be white. Then change the color of v to black. When this rule is applied, we say u forces v, and write u → v. A zero f orcing set of a graph G is a subset Z of vertices such that if initially the vertices in Z are colored black and remaining vertices are colored white, the entire graph G may be colored black by repeatedly applying the color-change rule. The zero forcing number of G, denoted Z(G), is the minimum size of a zero forcing set. In this paper, we investigate the zero forcing number for the generalized Petersen graphs (It is denoted by P (n, k)). We obtain upper and lower bounds for the zero forcing number for P (n, k). We show that Z(P (n, 2)) = 6 for n ≥ 10, Z(P (n, 3)) = 8 for n ≥ 12 and Z(P (2k + 1, k)) = 6 for k ≥ 5.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.