DOIAbstract
AbstractThe Hosoya index of a graph is defined as the total number of independent edge subsets of the graph. In this note, we characterize the trees with a given size of matching and having minimal and second minimal Hosoya index
AbstractThe Hosoya index of a graph is defined as the total number of independent edge subsets of the graph. In this note, we characterize the trees with a given size of matching and having minimal and second minimal Hosoya index
AbstractIt is well known that the two graph invariants, “the Merrifield–Simmons index” and “the Hoso...
AbstractLet T be an acyclic graph without perfect matching and Z(T) be its Hosoya index; let Fn be t...
The matching of an undirected graph G=(V,E) is a subset M of E such that no two edges of M are adjac...
AbstractThe Hosoya index of a graph is defined as the total number of independent edge subsets of th...
Given a molecular graph G, the Hosoya index Z(G) of G is defined as the total number of the matching...
AbstractThe Hosoya index and the Merrifield–Simmons index of a graph are defined as the total number...
AbstractThe Hosoya index z(G) of a graph G is defined as the number of matchings of G and the Merrif...
AbstractWe study the Hosoya index of trees with m-matchings and characterize the trees with m-matchi...
The Hosoya index of a graph is defined by the total number of the matchings of the graph. In this pa...
AbstractThe Hosoya index and the Merrifield–Simmons index of a graph are defined as the total number...
In this note we construct families of graphs whose Hosoya indices, i.e., the total numbers of matchi...
The Hosoya index of a (molecular) graph is defined as the total number of the matchings, including t...
For acyclic molecules, Ranđić4 introduced a family of topological indices, the path numbers mZ, m = ...
The Hosoya polynomial of a graph encompasses many of its metric properties, for instance the Wiener ...
Abstract. The Hosoya index and the Merrifield-Simmons index are two types of graph invariants used i...
AbstractIt is well known that the two graph invariants, “the Merrifield–Simmons index” and “the Hoso...
AbstractLet T be an acyclic graph without perfect matching and Z(T) be its Hosoya index; let Fn be t...
The matching of an undirected graph G=(V,E) is a subset M of E such that no two edges of M are adjac...
AbstractThe Hosoya index of a graph is defined as the total number of independent edge subsets of th...
Given a molecular graph G, the Hosoya index Z(G) of G is defined as the total number of the matching...
AbstractThe Hosoya index and the Merrifield–Simmons index of a graph are defined as the total number...
AbstractThe Hosoya index z(G) of a graph G is defined as the number of matchings of G and the Merrif...
AbstractWe study the Hosoya index of trees with m-matchings and characterize the trees with m-matchi...
The Hosoya index of a graph is defined by the total number of the matchings of the graph. In this pa...
AbstractThe Hosoya index and the Merrifield–Simmons index of a graph are defined as the total number...
In this note we construct families of graphs whose Hosoya indices, i.e., the total numbers of matchi...
The Hosoya index of a (molecular) graph is defined as the total number of the matchings, including t...
For acyclic molecules, Ranđić4 introduced a family of topological indices, the path numbers mZ, m = ...
The Hosoya polynomial of a graph encompasses many of its metric properties, for instance the Wiener ...
Abstract. The Hosoya index and the Merrifield-Simmons index are two types of graph invariants used i...
AbstractIt is well known that the two graph invariants, “the Merrifield–Simmons index” and “the Hoso...
AbstractLet T be an acyclic graph without perfect matching and Z(T) be its Hosoya index; let Fn be t...
The matching of an undirected graph G=(V,E) is a subset M of E such that no two edges of M are adjac...
Add to ORKG