Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 4

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote

Stein open subsets with analytic complements in compact complex spaces

100%
Zhang J.
Annales Polonici Mathematici
|
2015
|
tom 113
|
nr 1
43-60
EN
Let Y be an open subset of a reduced compact complex space X such that X - Y is the support of an effective divisor D. If X is a surface and D is an effective Weil divisor, we give sufficient conditions so that Y is Stein. If X is of pure dimension d ≥ 1 and X - Y is the support of an effective Cartier divisor D, we show that Y is Stein if Y contains no compact curves, $H^i (Y,𝓞_Y) = 0$ for all i > 0, and for every point x₀ ∈ X-Y there is an n ∈ ℕ such that $Φ_{|nD|}^{-1}(Φ_{|nD|}(x₀)) ∩ Y$ is empty or has dimension 0, where $Φ_{|nD|}$ is the map from X to the projective space defined by a basis of $H⁰(X,𝓞_X(nD))$.
2
Content available remote

The Minimum Spectral Radius of Signless Laplacian of Graphs with a Given Clique Number

51%
Su L., Li H.-H., Zhang J.
Discussiones Mathematicae Graph Theory
|
2014
|
tom 34
|
nr 1
95-102
EN
In this paper we observe that the minimal signless Laplacian spectral radius is obtained uniquely at the kite graph PKn−ω,ω among all connected graphs with n vertices and clique number ω. In addition, we show that the spectral radius μ of PKm,ω (m ≥ 1) satisfies [...] More precisely, for m > 1, μ satisfies the equation [...] where [...] and [...] . At last the spectral radius μ(PK∞,ω) of the infinite graph PK∞,ω is also discussed.
3
Content available remote

On The Determinant of q-Distance Matrix of a Graph

51%
Li H.-H., Su L., Zhang J.
Discussiones Mathematicae Graph Theory
|
2014
|
tom 34
|
nr 1
103-111
EN
In this note, we show how the determinant of the q-distance matrix Dq(T) of a weighted directed graph G can be expressed in terms of the corresponding determinants for the blocks of G, and thus generalize the results obtained by Graham et al. [R.L. Graham, A.J. Hoffman and H. Hosoya, On the distance matrix of a directed graph, J. Graph Theory 1 (1977) 85-88]. Further, by means of the result, we determine the determinant of the q-distance matrix of the graph obtained from a connected weighted graph G by adding the weighted branches to G, and so generalize in part the results obtained by Bapat et al. [R.B. Bapat, S. Kirkland and M. Neumann, On distance matrices and Laplacians, Linear Algebra Appl. 401 (2005) 193- 209]. In particular, as a consequence, determinantal formulae of q-distance matrices for unicyclic graphs and one class of bicyclic graphs are presented.
4
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

An efficient connected dominating set algorithm in wsns based on the induced tree of the crossed cube

45%
Zhang J., Xu L., Zhou S.-m., Wu W., Ye X.
International Journal of Applied Mathematics and Computer Science
|
2015
|
tom 25
|
nr 2
295-309
EN
The connected dominating set (CDS) has become a well-known approach for constructing a virtual backbone in wireless sensor networks. Then traffic can forwarded by the virtual backbone and other nodes turn off their radios to save energy. Furthermore, a smaller CDS incurs fewer interference problems. However, constructing a minimum CDS is an NP-hard problem, and thus most researchers concentrate on how to derive approximate algorithms. In this paper, a novel algorithm based on the induced tree of the crossed cube (ITCC) is presented. The ITCC is to find a maximal independent set (MIS), which is based on building an induced tree of the crossed cube network, and then to connect the MIS nodes to form a CDS. The priority of an induced tree is determined according to a new parameter, the degree of the node in the square of a graph. This paper presents the proof that the ITCC generates a CDS with a lower approximation ratio. Furthermore, it is proved that the cardinality of the induced trees is a Fibonacci sequence, and an upper bound to the number of the dominating set is established. The simulations show that the algorithm provides the smallest CDS size compared with some other traditional algorithms.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.