In Graph Theory, independent number and, dominating number are three of the important parameters to measure the resilience of graphs, respectively denoted by ( ) G  and ( ) G  for a graph G . But predecessors have proved that computing them are very hard. So computing ( ) G  and ( ) G  of some particular known graphs is extremely valuable. In this paper, we determine ( ) G  and ( ) G  of ...

The study of various dominating set problems is an important area within graph theory. In applications, a dominating set in a system can be considered as an ideal place for allocating resources. And, a minimal dominating set allows allocating a smaller number of resources. Distance-versions of the concept of minimal dominating sets are more applicable to modeling real-world problems, such as pl...

A subset S ⊆ V in a graph G = (V,E) is a k-quasiperfect dominating set (for k ≥ 1) if every vertex not in S is adjacent to at least one and at most k vertices in S. The cardinality of a minimum k-quasiperfect dominating set in G is denoted by γ 1k (G). Those sets were first introduced by Chellali et al. (2013) as a generalization of the perfect domination concept and allow us to construct a dec...

For every algebraically closed field k of characteristic different from 2, we prove the following: (1) Generic finite dimensional (not necessarily associative) kalgebras of a fixed dimension, considered up to isomorphism, are parametrized by the values of a tuple of algebraically independent over k rational functions in the structure constants. (2) There exists an “algebraic normal form”, to wh...

These problems can be solved trivially by trying all subsets of vertices/integers of size k, and checking whether they satisfy the condition in the problem. For k-SUM we get an O(n ·k) time algorithm and for k-CLIQUE we get O(n ·k) whereas for k-DOMINATING-SET we get O(n · n · k). We will show better algorithms for these problems. For k-SUM we’ll get an O(nd k 2 e) time algorithm. For k-CLIQUE ...

For a simple graph $G$ with vertex set $V(G)=\{v_1,...,v_n\}$, we define the closed neighborhood of $u$ as \\$N[u]=\{v \in V(G) \; | v \text{is adjacent to} u \text{or} v=u \}$ and matrix $N(G)$ whose $i$th column is characteristic vector $N[v_i]$. We say $S$ odd dominating if $N[u]\cap S$ for all $u\in V(G)$. prove that parity cardinality an equal to rank $G$, where defined dimension space $N(...

Let G be a finite and simple graph with vertex set V (G), and let f : V (G) → {−1, 1} be a two-valued function. If k ≥ 1 is an integer and ∑ x∈N(v) f(x) ≥ k for each v ∈ V (G), where N(v) is the neighborhood of v, then f is a signed total k-dominating function on G. A set {f1, f2, . . . , fd} of distinct signed total k-dominating functions on G with the property that ∑d i=1 fi(x) ≤ j for each x...