ProDomAs, protein domain assignment algorithm using center-based clustering and independent dominating set

2014 ◽  
Vol 82 (9) ◽  
pp. 1937-1946 ◽  
Author(s):  
Elnaz Saberi Ansari ◽  
Changiz Eslahchi ◽  
Hamid Pezeshk ◽  
Mehdi Sadeghi
Keyword(s):  
Dominating Set ◽  
Protein Domain ◽  
Domain Assignment ◽  
Assignment Algorithm ◽  
Independent Dominating Set

scholarly journals Independent dominating set problem revisited

2015 ◽  
Vol 562 ◽  
pp. 1-22 ◽  
Author(s):  
Ching-Hao Liu ◽  
Sheung-Hung Poon ◽  
Jin-Yong Lin
Keyword(s):  
Dominating Set ◽  
Dominating Set Problem ◽  
Independent Dominating Set

scholarly journals Independent Domination Stable Trees and Unicyclic Graphs

Mathematics ◽  
2019 ◽  
Vol 7 (9) ◽  
pp. 820
Author(s):  
Pu Wu ◽  
Huiqin Jiang ◽  
Sakineh Nazari-Moghaddam ◽  
Seyed Mahmoud Sheikholeslami ◽  
Zehui Shao ◽  
...  
Keyword(s):  
Dominating Set ◽  
Domination Number ◽  
Minimum Cardinality ◽  
Unicyclic Graphs ◽  
Basic Properties ◽  
Independent Domination ◽  
Independent Dominating Set

A set S ⊆ V ( G ) in a graph G is a dominating set if every vertex of G is either in S or adjacent to a vertex of S . A dominating set S is independent if any pair of vertices in S is not adjacent. The minimum cardinality of an independent dominating set on a graph G is called the independent domination number i ( G ) . A graph G is independent domination stable if the independent domination number of G remains unchanged under the removal of any vertex. In this paper, we study the basic properties of independent domination stable graphs, and we characterize all independent domination stable trees and unicyclic graphs. In addition, we establish bounds on the order of independent domination stable trees.

scholarly journals On the Total Outer k-Independent Domination Number of Graphs

Mathematics ◽  
2020 ◽  
Vol 8 (2) ◽  
pp. 194 ◽  
Author(s):  
Abel Cabrera-Martínez ◽  
Juan Carlos Hernández-Gómez ◽  
Ernesto Parra-Inza ◽  
José María Sigarreta Almira
Keyword(s):  
Maximum Degree ◽  
Dominating Set ◽  
Domination Number ◽  
Dominating Sets ◽  
Minimum Cardinality ◽  
Total Dominating Set ◽  
Np Hard Problem ◽  
Independent Domination ◽  
Independent Dominating Set ◽  
Computational Properties

A set of vertices of a graph G is a total dominating set if every vertex of G is adjacent to at least one vertex in such a set. We say that a total dominating set D is a total outer k-independent dominating set of G if the maximum degree of the subgraph induced by the vertices that are not in D is less or equal to k − 1 . The minimum cardinality among all total outer k-independent dominating sets is the total outer k-independent domination number of G. In this article, we introduce this parameter and begin with the study of its combinatorial and computational properties. For instance, we give several closed relationships between this novel parameter and other ones related to domination and independence in graphs. In addition, we give several Nordhaus–Gaddum type results. Finally, we prove that computing the total outer k-independent domination number of a graph G is an NP-hard problem.

Independent domination number in Cayley digraphs of rectangular groups

2018 ◽  
Vol 10 (02) ◽  
pp. 1850024
Author(s):  
Nuttawoot Nupo ◽  
Sayan Panma
Keyword(s):  
Dominating Set ◽  
Domination Number ◽  
Independent Set ◽  
Left Zero ◽  
Zero Semigroup ◽  
Left Zero Semigroup ◽  
Group A ◽  
Independent Domination ◽  
Independent Dominating Set ◽  
Rectangular Group

Let [Formula: see text] denote the Cayley digraph of the rectangular group [Formula: see text] with respect to the connection set [Formula: see text] in which the rectangular group [Formula: see text] is isomorphic to the direct product of a group, a left zero semigroup, and a right zero semigroup. An independent dominating set of [Formula: see text] is the independent set of elements in [Formula: see text] that can dominate the whole elements. In this paper, we investigate the independent domination number of [Formula: see text] and give more results on Cayley digraphs of left groups and right groups which are specific cases of rectangular groups. Moreover, some results of the path independent domination number of [Formula: see text] are also shown.

Independent dominating sets in graphs of girth five

2020 ◽  
pp. 1-16
Author(s):  
Ararat Harutyunyan ◽  
Paul Horn ◽  
Jacques Verstraete
Keyword(s):  
Minimum Degree ◽  
Dominating Set ◽  
Regularity Conditions ◽  
Dominating Sets ◽  
Vertex Graph ◽  
First Results ◽  
Complete Bipartite Graphs ◽  
Image Position ◽  
Almost All ◽  
Independent Dominating Set

Abstract Let $\gamma(G)$ and $${\gamma _ \circ }(G)$$ denote the sizes of a smallest dominating set and smallest independent dominating set in a graph G, respectively. One of the first results in probabilistic combinatorics is that if G is an n-vertex graph of minimum degree at least d, then $$\begin{equation}\gamma(G) \leq \frac{n}{d}(\log d + 1).\end{equation}$$ In this paper the main result is that if G is any n-vertex d-regular graph of girth at least five, then $$\begin{equation}\gamma_(G) \leq \frac{n}{d}(\log d + c)\end{equation}$$ for some constant c independent of d. This result is sharp in the sense that as $d \rightarrow \infty$ , almost all d-regular n-vertex graphs G of girth at least five have $$\begin{equation}\gamma_(G) \sim \frac{n}{d}\log d.\end{equation}$$ Furthermore, if G is a disjoint union of ${n}/{(2d)}$ complete bipartite graphs $K_{d,d}$ , then ${\gamma_\circ}(G) = \frac{n}{2}$ . We also prove that there are n-vertex graphs G of minimum degree d and whose maximum degree grows not much faster than d log d such that ${\gamma_\circ}(G) \sim {n}/{2}$ as $d \rightarrow \infty$ . Therefore both the girth and regularity conditions are required for the main result.

scholarly journals Fast algorithms for min independent dominating set

2013 ◽  
Vol 161 (4-5) ◽  
pp. 558-572 ◽  
Author(s):  
N. Bourgeois ◽  
F. Della Croce ◽  
B. Escoffier ◽  
V.Th. Paschos
Keyword(s):  
Dominating Set ◽  
Fast Algorithms ◽  
Independent Dominating Set

Independent domination in signed graphs

2020 ◽  
pp. 2150065
Author(s):  
P. Jeyalakshmi ◽  
K. Karuppasamy ◽  
S. Arockiaraj
Keyword(s):  
Dominating Set ◽  
Domination Number ◽  
Signed Graph ◽  
Signed Graphs ◽  
Independent Domination ◽  
Independent Dominating Set

Let [Formula: see text] be a signed graph. A dominating set [Formula: see text] is said to be an independent dominating set of [Formula: see text] if [Formula: see text] is a fully negative. In this paper, we initiate a study of this parameter. We also establish the bounds and characterization on the independent domination number of a signed graph.

scholarly journals Improved Memetic Algorithm for Solving the Minimum Weight Vertex Independent Dominating Set

Mathematics ◽  
2020 ◽  
Vol 8 (7) ◽  
pp. 1155 ◽  
Author(s):  
Yupeng Zhou ◽  
Jinshu Li ◽  
Yang Liu ◽  
Shuai Lv ◽  
Yong Lai ◽  
...  
Keyword(s):  
Dynamic Optimization ◽  
Memetic Algorithm ◽  
State Of The Art ◽  
Dominating Set ◽  
Minimum Weight ◽  
High Quality ◽  
Local Optima ◽  
Configuration Checking ◽  
Improved Memetic Algorithm ◽  
Independent Dominating Set

The minimum weight vertex independent dominating set (MWVIDS) problem is an important version of the minimum independent dominating set. The MWVIDS problem has a number of applications in many fields. However, the MWVIDS problem is known to be NP-hard and thus computationally challenging. In this work, we present the improved memetic algorithm called MSSAS for solving the MWVIDS problem. The proposed MSSAS algorithm combines probability-based dynamic optimization (PDO) (to generate good and diverse offspring solutions by assembling elements of existing good solutions) as well as a local search phase named C_LS (to seek high-quality local optima by combining the idea of constrained-based two-level configuration checking strategy and tabu mechanism). The extensive results on popular DIMACS and BHOLIB benchmarks demonstrate that MSSAS competes favorably with the state-of-the-art algorithms. In addition, we analyze the benefits of the newly raised components including two above proposed ideas with our memetic framework. It is worth mentioning that the combination of both components has excellent effects for the MWVIDS problem.

Sign in / Sign up

Export Citation Format

Share Document