Results 11 to 20 of about 9,718,887 (99)

Pole type singularities and the numerical conformal mapping of doubly-connected domains [PDF]

, 1983
Let f be the function which maps conformally a given doubly-connected domain onto a circular annulus, and let Ω H(z) = f '(z) / f(z) - 1/z . In this paper we consider the problem of determining the main singularities of the function H in compl)(Ω∂∪Ω ...
Warby, M K, Papamichael, N
core   +7 more sources

An orthonormalization method for the approximate conformal mapping of multiply-connected domains [PDF]

, 1988
We consider the use of an orthonormalization method for constructing approximations to one of the standard conformal maps for multiply-connected domains. The method has been used successfully in [12], but only for the mapping of doubly-connected domains.
Kokkinos, CA, Sideridis, AB, Papamichael, N   +2 more
core   +6 more sources

Stability and covergence properties of Bergman Kernel methods for numerical conformal mapping [PDF]

, 1984
In this paper we study the stability and convergence properties of Bergman kernel methods, for the numerical conform al mapping of simply and doubly- connected domains.
Warby, M K, Papamichael, N
core   +6 more sources

Triple Connected Domination Number of a Graph [PDF]

, 2012
The concept of triple connected graphs with real life application was introduced by considering the existence of a path containing any three vertices of a graph G.
Selvam Avadayappan, T.Subramanian, Joseph, Paulraj, J.Paulraj Joseph, G.Mahadevan, Avadayappan, Selvam, Subramanian, T., Mahadevan, G.   +7 more
core   +1 more source

The Forcing Domination Number of Hamiltonian Cubic Graphs [PDF]

, 2009
The authors presented a sequence of Hamiltonian cubic graphs whose domination numbers are sharp and in this paper we study forcing domination number for those ...
H. Abdollahzadeh Ahangar, H.Abdollahzadeh Ahangar, Abdollahzadeh Ahangar, H., Pushpalatha L.   +3 more
core   +1 more source

Connected power domination number of product graphs [PDF]

, 2022
In this paper, we consider the connected power domination number ($\gamma_{P, c}$) of three standard graph products. The exact value for $\gamma_{P, c}(G\circ H)$ is obtained for any two non-trivial graphs $G$ and $H.$ Further, tight upper bounds are ...
Ganesamurthy, S., Srimathi, R., Jeyaranjan, J.   +2 more
core   +1 more source

Weakly connected domination stable trees [PDF]

, 1983
summary:A dominating set $D\subseteq V(G)$ is a {\it weakly connected dominating set} in $G$ if the subgraph $G[D]_w=(N_G[D],E_w)$ weakly induced by $D$ is connected, where $E_w$ is the set of all edges having at least one vertex in $D$.
Lemańska, Magdalena, Pattie Blitch, Sumner, David P, Blitch, Pattie, David P Sumner, Raczek, Joanna   +5 more
core   +1 more source

Inequalities involving independence domination, $f$-domination, connected and total $f$-domination numbers [PDF]

, 1978
summary:Let $f$ be an integer-valued function defined on the vertex set $V(G)$ of a graph $G$. A subset $D$ of $V(G)$ is an $f$-dominating set if each vertex $x$ outside $D$ is adjacent to at least $f(x)$ vertices in $D$.
Allan, Robert B., Wei, Bing, Muthammai, S., Zhou, Sanming, Laskar, Renu, Janakiraman, T. N., Wang, Shaohui, Bhanumathi, M.   +7 more
core   +1 more source

On the comparison of two numerical methods for conformal mapping [PDF]

, 1986
Let G be a simply-connected domain in the t—plane (t = x + iy), bounded by the three straight lines x = 0, y = 0, x =1 and a Jordan arc with cartesian equation y = τ (X).
Gaier, D, Papamichael, N
core   +5 more sources

Some inequalities about connected domination number [PDF]

, 1996
Let G = (V,E) be a graph. In this note, γc, ir, γ, i, β0, Γ, IR denote the connected domination number, the irredundance number, the domination number, the independent domination number, the independence number, the upper domination number and the upper ...
Liu, Bolian, Bo, Cheng
core   +1 more source