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

Znaleziono wyników: 9

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
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

A note on (k,l)-kernels in B-products of graphs

100%
EN
B-products of graphs and their generalizations were introduced in [4]. We determined the parameters k, l of (k,l)-kernels in generalized B-products of graphs. These results are generalizations of theorems from [2].
2
100%
EN
In this paper we give a generalization of the Pell numbers and the Pell-Lucas numbers and next we apply this concept for their graph representations. We shall show that the generalized Pell numbers and the Pell-Lucas numbers are equal to the total number of k-independent sets in special graphs.
3
Content available remote

On kernels by monochromatic paths in the corona of digraphs

100%
Open Mathematics
|
2008
|
tom 6
|
nr 4
537-542
EN
In this paper we derive necessary and sufficient conditions for the existence of kernels by monochromatic paths in the corona of digraphs. Using these results, we are able to prove the main result of this paper which provides necessary and sufficient conditions for the corona of digraphs to be monochromatic kernel-perfect. Moreover we calculate the total numbers of kernels by monochromatic paths, independent by monochromatic paths sets and dominating by monochromatic paths sets in this digraphs product.
4
Content available remote

Fibonacci and Telephone Numbers in Extremal Trees

64%
EN
In this paper we shall show applications of the Fibonacci numbers in edge-coloured trees. In particular we determine the successive extremal graphs in the class of trees with respect to the number of (A, 2B)-edge colourings. We show connections between these numbers and Fibonacci numbers as well as the telephone numbers.
5
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

On Pell and Pell−Lucas Hybrid Numbers

64%
EN
In this paper we introduce the Pell and Pell−Lucas hybrid numbers as special kinds of hybrid numbers. We describe some properties of Pell hybrid numbers and Pell−Lucas hybrid numbers among other we give the Binet formula, the character and the generating function for these numbers.
EN
In this paper we determine successive extremal trees with respect to the number of all \((A,2B)\)-edge colourings.
7
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

On (2-d)-kernels in the cartesian product of graphs

64%
EN
In this paper we study the problem of the existence of (2-d)-kernels in the cartesian product of graphs. We give sufficient conditions for the existence of (2-d)-kernels in the cartesian product and also we consider the number of (2-d)-kernels.
8
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

On generalized Mersenne hybrid numbers

64%
EN
The hybrid numbers are generalization of complex, hyperbolic and dual numbers. In this paper we consider  a special kind of hybrid numbers, namely the Mersenne hybrid numbers and we give some of their properties.
9
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

On (k,l)-kernels in D-join of digraphs

51%
EN
In [5] the necessary and sufficient conditions for the existence of (k,l)-kernels in a D-join of digraphs were given if the digraph D is without circuits of length less than k. In this paper we generalize these results for an arbitrary digraph D. Moreover, we give the total number of (k,l)-kernels, k-independent sets and l-dominating sets in a D-join of digraphs.
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ć.