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...
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].
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.
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.
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.
In this paper we determine successive extremal trees with respect to the number of all -edge colourings.
In this paper we consider two parameters generalization of the Fibonacci numbers and Pell numbers, named as the -Fibonacci numbers. We give some new interpretations of these numbers. Moreover using these interpretations we prove some identities for the -Fibonacci numbers.
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.
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.
In this paper we introduce bihyperbolic numbers of the Fibonacci type. We present some of their properties using matrix generators and idempotent representations.
We study generalized commutative Jacobsthal quaternions and generalized commutative Jacobsthal-Lucas quaternions. We present some properties of these quaternions and the relations between the generalized commutative Jacobsthal quaternions and generalized commutative Jacobsthal-Lucas quaternions.
Download Results (CSV)