Abstract

Let G = (V;E) be a simple graph of order n and size m. An r-matching of G is a set of r edges of G which no two of them have common vertex. The Hosoya index Z(G) of a graph G is dened

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call