Learn More
Given an ordered partition Π = {P 1 , P 2 , ..., P t } of the vertex set V of a connected graph G = (V, E), the partition representation of a vertex v ∈ V with respect to the partition Π is the vector r(v|Π)) represents the distance between the vertex v and the set P i. A partition Π of V is a resolving partition of G if different vertices of G have(More)
The weakly connected domination subdivision number sd γw (G) of a connected graph G is the minimum number of edges which must be subdivided (where each edge can be subdivided at most once) in order to increase the weakly connected domination number. The graph is strong-γ w-subdivisible if for each edge uv ∈ E(G) we have γ w (G uv) > γ w (G), where G uv is a(More)
From 1985 to the end of 1993, 15,000 investigations were performed in total, for HIV infection in the Province of Gdańsk. Positive results of the tests were found in 316 persons, over 60% of whom being intravenous drug-addicts. In the group of persons reporting the possibility of infection through sexual contacts, the infection was found only in 15 out of(More)