Andrzej Wloch

Orcid: 0000-0003-1789-6280

According to our database1, Andrzej Wloch authored at least 23 papers between 1996 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Distance Fibonacci Polynomials by Graph Methods.
Symmetry, 2021

(2, k)-Distance Fibonacci Polynomials.
Symmetry, 2021

New explicit high-order one-step methods for singular initial value problems.
Comput. Math. Methods, 2021

2014
On Types of Distance Fibonacci Numbers Generated by Number Decompositions.
J. Appl. Math., 2014

On generalized Pell numbers generated by Fibonacci and Lucas numbers.
Ars Comb., 2014

2013
On a new type of distance Fibonacci numbers.
Discret. Appl. Math., 2013

Generalized Pell numbers and some relations with Fibonacci numbers.
Ars Comb., 2013

(k, α<sub>n-1</sub>)-Fibonacci numbers and P<sub>k</sub>-matchings in multigraphs.
Ars Comb., 2013

Some identities for the generalized Fibonacci numbers and the generalized Lucas numbers.
Appl. Math. Comput., 2013

2012
On generalized Fibonacci numbers and k-distance K<sub>p</sub>-matchings in graphs.
Discret. Appl. Math., 2012

On 2-dominating kernels in graphs.
Australas. J Comb., 2012

2011
Genralized Padovan numbers, Perrin numbers and maximal k-indpendent sets in graphs.
Ars Comb., 2011

2010
Generalized sequences and k-independent sets in graphs.
Discret. Appl. Math., 2010

Generalized Pell numbers, graph representations and independent sets.
Australas. J Comb., 2010

2009
Fibonacci numbers and Lucas numbers in graphs.
Discret. Appl. Math., 2009

2008
On the existence and on the number of (k, l)-kernels in the lexicographic product of graphs.
Discret. Math., 2008

2007
On <i>(k, l)</i>-kernels in <i> D</i>-join of digraphs.
Discuss. Math. Graph Theory, 2007

Monochromatic Fibonacci Numbers of Graphs.
Ars Comb., 2007

The number of independent sets intersecting the set of leaves in trees.
Ars Comb., 2007

2005
The total number of maximal k-independent sets in the generalized lexicographical product of graphs.
Ars Comb., 2005

1999
Distance perfectness of graphs.
Discuss. Math. Graph Theory, 1999

1997
On (k, l)-kernels in generalized products.
Discret. Math., 1997

1996
A note on strong and co-strong perfectness of the X-join of graphs.
Discuss. Math. Graph Theory, 1996


  Loading...