Let $G = (V,E)$ be a bipartite graph with partite sets $X$ and $Y$. Two vertices of $X$ are $X$-adjacent if they have a common neighbor in $Y$, and they are $X$-independent otherwise. A subset $D \subseteq X$ is an $X$-outer-independent dominating set of $G$ if every vertex of $X \setminus D$ has an $X$-neighbor in $D$, and all vertices of $X \setminus D$ are pairwise $X$-independent. The $X$-outer-independent domination number...

Abstract: The cardinality of a largest independent set of G, denoted by α(G), is called the independence number of G. The independent domination number i(G) of a graph G is the cardinality of a smallest independent dominating set of G. We introduce the concept of the common independence number of a graph G, denoted by αc(G), as the greatest integer r such that every vertex of G belongs to some independent subset X of VG with |X|...

An acoustic second-order low-pass filter is proposed for filter banks emulating the operation of a human cochlea. By using a special filter structure and an innovative quality (Q)-factor tuning technique, an independent change of the cutoff frequency (ω0) and the Q-factor with unchanged gain at low frequencies is achieved in this filter. The techniques applied result in a simple filter design with low Q-factor sensitivity to component...

The tricyclic antipsychotic and antidepressant drug opipramol (opipramole) was examined with regard to the chemical structure of its organic impurities. Impurities were isolated from the technical product by chromatographic methods and their chemical structures were established by 1H NMR, MS and FTIR and further confirmed by comparison with commercially available products or with products obtained by independent synthesis, and...

Given a graph G= (V, E), the subdivision of an edge e=uv∈E(G) means the substitution of the edge e by a vertex x and the new edges ux and xv. The domination subdivision number of a graph G is the minimum number of edges of G which must be subdivided (where each edge can be subdivided at most once) in order to increase the domination number. Also, the domination multisubdivision number of G is the minimum number of subdivisions...