Sorry, we do not have enough data to show an influence graph for this author.
- Full text PDF available (2)
- This year (0)
- Last 5 years (2)
- Last 10 years (2)
Journals and Conferences
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)
It will be shown that each information system can be considered a soft set and each finite soft set can be considered an information system.