A Linear Algorithm for Computing $\gamma_{[1,2]}$-set in Generalized Series-Parallel Graphs
نویسندگان
چکیده
For a graph G = (V,E), a set S ⊆ V is a [1, 2]-set if it is a dominating set for G and each vertex v ∈ V \S is dominated by at most two vertices of S, i.e. 1 ≤ |N(v)∩S| ≤ 2. Moreover a set S ⊆ V is a total [1, 2]-set if for each vertex of V , it is the case that 1 ≤ |N(v)∩S| ≤ 2. The [1, 2]-domination number of G, denoted γ[1,2](G), is the minimum number of vertices in a [1, 2]-set. Every [1, 2]-set with cardinality of γ[1,2](G) is called a γ[1,2]-set. Total [1, 2]-domination number and γt[1,2]-sets of G are defined in a similar way. This paper presents a linear time algorithm to find a γ[1,2]-set and a γt[1,2]-set in generalized series-parallel graphs.
منابع مشابه
A Linear Algorithm for Computing γ[1,2]-set in Generalized Series-Parallel Graphs
For a graph G = (V,E), a set S ⊆ V is a [1, 2]-set if it is a dominating set for G and each vertex v ∈ V \S is dominated by at most two vertices of S, i.e. 1 ≤ |N(v)∩S| ≤ 2. Moreover a set S ⊆ V is a total [1, 2]-set if for each vertex of V , it is the case that 1 ≤ |N(v)∩S| ≤ 2. The [1, 2]-domination number of G, denoted γ[1,2](G), is the minimum number of vertices in a [1, 2]-set. Every [1, 2...
متن کاملGraceful labelings of the generalized Petersen graphs
A graceful labeling of a graph $G=(V,E)$ with $m$ edges is aninjection $f: V(G) rightarrow {0,1,ldots,m}$ such that the resulting edge labelsobtained by $|f(u)-f(v)|$ on every edge $uv$ are pairwise distinct. For natural numbers $n$ and $k$, where $n > 2k$, a generalized Petersengraph $P(n, k)$ is the graph whose vertex set is ${u_1, u_2, cdots, u_n} cup {v_1, v_2, cdots, v_n}$ and its edge set...
متن کاملNILPOTENT GRAPHS OF MATRIX ALGEBRAS
Let $R$ be a ring with unity. The undirected nilpotent graph of $R$, denoted by $Gamma_N(R)$, is a graph with vertex set ~$Z_N(R)^* = {0neq x in R | xy in N(R) for some y in R^*}$, and two distinct vertices $x$ and $y$ are adjacent if and only if $xy in N(R)$, or equivalently, $yx in N(R)$, where $N(R)$ denoted the nilpotent elements of $R$. Recently, it has been proved that if $R$ is a left A...
متن کاملComputing Wiener and hyper–Wiener indices of unitary Cayley graphs
The unitary Cayley graph Xn has vertex set Zn = {0, 1,…, n-1} and vertices u and v are adjacent, if gcd(uv, n) = 1. In [A. Ilić, The energy of unitary Cayley graphs, Linear Algebra Appl. 431 (2009) 1881–1889], the energy of unitary Cayley graphs is computed. In this paper the Wiener and hyperWiener index of Xn is computed.
متن کاملSet a bi-objective redundancy allocation model to optimize the reliability and cost of the Series-parallel systems using NSGA II problem
With the huge global and wide range of attention placed upon quality, promoting and optimize the reliability of the products during the design process has turned out to be a high priority. In this study, the researcher have adopted one of the existing models in the reliability science and propose a bi-objective model for redundancy allocation in the series-parallel systems in accordance with th...
متن کامل