Zofia Machnicka

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Sorry, we do not have enough data to show an influence graph for this author.
Learn More
A subset M of the edge set E(G) of a graph G is a matching if no two edges of M are adjacent in G. In this paper we study the number of matchings in graphs, that is the Hosoya index. We study the problem of maximizing and minimizing the Hosoya index in a graph. For specific graphs this topological index is maximized by the Fibonacci number or the Lucas(More)
  • 1