We study the Independent Set problem in H-free graphs, i.e., graphs excluding some fixed graph H as an induced subgraph. prove several inapproximability results both for polynomial-time and parameterized algorithms. Halldórsson [SODA 1995] showed that every $$\delta >0$$ has a $$(\frac{d-1}{2}+\delta )$$ -approximation algorithm $$K_{1,d}$$ -free graphs. extend this result by showing $$K_{a,b}$...

For any h in N , a graph G = (V, E) is said to be h-magic if there exists a labeling l: E(G) to Z_{h}-{0} such that the induced vertex set labeling l^{+: V(G) to Z_{h}} defined by l^{+}(v)= Summation of l(uv)such that e=uvin in E(G) is a constant map. For a given graph G, the set of all for which G is h-magic is called the integer-magic spectrum of G and is denoted by IM(G). In this paper, the ...

Whereas the average error capacity region Ra for the MAC W : X ×Y → Z is known for a long time (Ahlswede 71), very little is known about the capacity region Rm for the maximal error concept (as predicted also by Ahlswede in 71). Inspite of great efforts during the past three decades even for some special examples of deterministic MAC, for which the maximal error concept coincides with the conce...

This paper proposes a rough set theoretic approach to Domain theory, thereby establishing a direct connection between Rough Set Theory and Domain Theory. With a rough set theoretic mind-set, we tailor-made new approximation operators specially suited for Domain Theory. Our proposed approach not only offers a fresh perspective to existing concepts and results in Domain Theory through the rough s...

a concept of weak $f$-property for a set-valued mapping is introduced‎, ‎and then under some suitable assumptions‎, ‎which do not involve any information‎ ‎about the solution set‎, ‎the lower semicontinuity of the solution mapping to‎ ‎the parametric‎ ‎set-valued vector equilibrium-like problems are derived by using a density result and scalarization method‎, ‎where the‎ ‎constraint set $k$...

let $g$ be a finite group and let $text{cd}(g)$ be the set of all‎ ‎complex irreducible character degrees of $g$‎. ‎b‎. ‎huppert conjectured‎ ‎that if $h$ is a finite nonabelian simple group such that‎ ‎$text{cd}(g) =text{cd}(h)$‎, ‎then $gcong h times a$‎, ‎where $a$ is‎ ‎an abelian group‎. ‎in this paper‎, ‎we verify the conjecture for‎ ‎${f_4(2)}.$‎

A concept of weak $f$-property for a set-valued mapping is introduced‎, ‎and then under some suitable assumptions‎, ‎which do not involve any information‎ ‎about the solution set‎, ‎the lower semicontinuity of the solution mapping to‎ ‎the parametric‎ ‎set-valued vector equilibrium-like problems are derived by using a density result and scalarization method‎, ‎where the‎ ‎constraint set $K$...

We construct an approximating chain of simple valuations on the upper space of a compact metric space whose lub is a given probability measure on the metric space. We show that whenever a separable metric space is homeomorphic to a G subset of an !-continuous dcpo equipped with its Scott topology, then the space of probability measures of the metric space equipped with the weak topology is home...

‎for any group $g$‎, ‎we define an equivalence relation $thicksim$ as below‎: ‎[forall g‎, ‎h in g gthicksim h longleftrightarrow |g|=|h|]‎ ‎the set of sizes of equivalence classes with respect to this relation is called the same-order type of $g$ and denote by $alpha{(g)}$‎. ‎in this paper‎, ‎we give a partial answer to a conjecture raised by shen‎. ‎in fact‎, ‎we show that if $g$ is a nilpote...