PL
 |
EN
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników
Powiadomienia systemowe
  • Sesja wygasła!

Znaleziono wyników: 11

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 On F(p, n)-Fibonacci bicomplex numbers
Liana M., Szynal-Liana A., Włoch I.
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
|
2018
|
Vol. 23
35--44
EN
In this paper we introduce F(p, n)-Fibonacci bicomplex numbers and L(p, n)-Lucas bicomplex numbers as a special type of bicomplex numbers. We give some their properties and describe relations between them.
2
Content available remote On Pell and Pell-Lucas Hybrid Numbers
Szynal-Liana A., Włoch I.
Commentationes Mathematicae
|
2018
|
Vol. 58, No. 1/2
11--17
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.
3
Content available Some properties of generalized tribonacci quaternions
Szynal-Liana A., Włoch I.
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
|
2017
|
Vol. 22
73--81
EN
In this paper we introduce distinct types of Tribonacci quaternions. We describe dependences between them and we give some their properties also related to a matrix representation.
4
Content available On Fibonacci numbers in edge coloured trees
Bednarz U., Bród D., Szynal-Liana A., Włoch I., Wołowiec-Musiał M.
Opuscula Mathematica
|
2017
|
Vol. 37, no. 4
479--490
EN
In this paper we show the applications of the Fibonacci numbers in edge coloured trees. We determine the second smallest number of all (A, 2B)-edge colourings in trees. We characterize the minimum tree achieving this second smallest value.
5
Content available remote On parameters of independence, domination and irredundance in edge-coloured graphs and their products
Włoch A., Włoch I.
Journal of Mathematics and Applications
|
2012
|
Vol. 35
97--106
EN
In this paper we study some parameters of domination, independence and irredundance in some edge-coloured graphs and their products. We present several general properties of independent, dominating and irredundance sets in edge-coloured graphs and we give relationships between the independence, domination and irredundant numbers of an edge-coloured graph. We generalize some classical results concerning independence, domination and irredundance in graphs. Moreover we study G-join of edge-coloured graphs which preserves considered parameters with respect to related parameters in product factors.
6
Content available remote On generalized Pell numbers and their graph representations
Włoch I.
Commentationes Mathematicae
|
2008
|
Vol. 48, [Z] 2
169-175
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.
7
Content available remote On the existence of (k,k-1) - kernels in directed graphs
Bród D., Włoch A., Włoch I.
Journal of Mathematics and Applications
|
2006
|
Vol. 28
7-12
EN
We calI a subset J of vertices of a digraph D as a (k, k-1) - kerneI of D, for a fixed k ≥ 2, if all distanees between vertices from J are at Ieast k and the distance from each vertex not belonging to J to the set J is at most k - 1. Some theorems concerning the existence of (k, k - 1) - kernels are proved. The resuIts generalize the well - known Riehardson theorem [9], which says: A digraph without odd circuits has a kernel.
8
Content available remote Fibonacci numbers of trees
Startek M., Włoch A., Włoch I.
Journal of Mathematics and Applications
|
2006
|
Vol. 28
137-145
EN
In [6] it was presented a graph-representation of the Fibonacci numbers Fn and Lucas numbers Ln. It is interesting to know that they are the totał numbers of independent sets of undirected graphs Pn and Cn, respectively. More general concept of the number of all k-independent sets of graphs Pn and Cn was discussed in [5]. In [6], [7] it was bounded the number of all independent sets of a tree Tn. In this paper we propose the method which estimate the number Fk(Tn) of all k-independent sets of Tn. We also describe graphs G for which the numbers Fk(G) are the generalizations of the Fibonacci numbers.
9
The total number of stable sets in some classes of trees
Startek M., Włoch I.
Zeszyty Naukowe Politechniki Rzeszowskiej. Matematyka
|
2000
|
z. 24 [181]
131-135
EN
A graph representation of the Fibonacci numbers Fn it was given in [3]. They proved that Fn is the number of all stable sets of undirected graph Pn. In [4], [5] authors bounded the number of all maximal stable sets in trees on n vertices. In this paper we determine the number of all stable sets in some kinds of trees. These results are given by the linear recurrence relations containing generalized Fibonacci number.
10
On the number of all stable sets in special kinds of trees
Startek M., Włoch I.
Zeszyty Naukowe Politechniki Rzeszowskiej. Matematyka
|
2000
|
z. 24 [181]
125-130
EN
In [3] it was presented a graph representation of the Fibonacci numbers Fn. It is interesting to know that Fn is the total number of all stable sets of undirected graph Pn. In [4], [6] it was bounded the number of all maximal (with respect to set inclusion) stable sets in trees on n vertices. Only for special kinds of trees the number of all stable sets can be determined. Our aim is to determine the number of all stable sets in special kinds of trees. These results are given by the second-order linear recurrence relations which generalized the Fibonacci number.
11
The number of all stable sets in some classes of graphs
Startek M., Włoch I.
Zeszyty Naukowe Politechniki Rzeszowskiej. Matematyka
|
1999
|
z. 23 [175]
117-121
EN
In [3] it was presented a graph representation of the Fibonacci numbers Fn. It is interesting to know that Fn is the total number of all stable sets of undirected graph Pn. In [4], [5] it was estimated the number of all stable sets in trees on n vertices. Our aim is to determine the number of all stable sets in special kinds of trees. These results are given by the second-order linear recurrence relations which generalized the Fibonacci number.
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ć.