AbstractWe study the Hosoya index of trees with m-matchings and characterize the trees with m-matchings and the fourth and fifth minimal Hosoya index respectively
Wiener index is one of the most well known and studied chemical indices. The extremal problems of fi...
15 p.The 2-methyl alkanes, the cyclic alkanes, and the 1-methyl bicyclo[X.1.0] alkanes are shown to ...
AbstractThe Harary index is defined as the sum of reciprocals of distances between all pairs of vert...
AbstractWe study the Hosoya index of trees with m-matchings and characterize the trees with m-matchi...
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...
AbstractIt is well known that the two graph invariants, “the Merrifield–Simmons index” and “the Hoso...
In this note we construct families of graphs whose Hosoya indices, i.e., the total numbers of matchi...
AbstractThe Hosoya index and the Merrifield–Simmons index of a graph are defined as the total number...
We characterize the trees T with n vertices whose Hosoya index (total number of matchings) is Z(T)&g...
The Hosoya index of a graph is defined by the total number of the matchings of the graph. In this pa...
AbstractIn this paper we consider the trees with fixed order n and diameter d≤4. Among these trees w...
AbstractThe Hosoya index and the Merrifield–Simmons index of a graph are defined as the total number...
The M-tree is a well-known indexing method enabling efficient similarity search in metric spaces. Al...
The matching of an undirected graph G=(V,E) is a subset M of E such that no two edges of M are adjac...
Wiener index is one of the most well known and studied chemical indices. The extremal problems of fi...
15 p.The 2-methyl alkanes, the cyclic alkanes, and the 1-methyl bicyclo[X.1.0] alkanes are shown to ...
AbstractThe Harary index is defined as the sum of reciprocals of distances between all pairs of vert...
AbstractWe study the Hosoya index of trees with m-matchings and characterize the trees with m-matchi...
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...
AbstractIt is well known that the two graph invariants, “the Merrifield–Simmons index” and “the Hoso...
In this note we construct families of graphs whose Hosoya indices, i.e., the total numbers of matchi...
AbstractThe Hosoya index and the Merrifield–Simmons index of a graph are defined as the total number...
We characterize the trees T with n vertices whose Hosoya index (total number of matchings) is Z(T)&g...
The Hosoya index of a graph is defined by the total number of the matchings of the graph. In this pa...
AbstractIn this paper we consider the trees with fixed order n and diameter d≤4. Among these trees w...
AbstractThe Hosoya index and the Merrifield–Simmons index of a graph are defined as the total number...
The M-tree is a well-known indexing method enabling efficient similarity search in metric spaces. Al...
The matching of an undirected graph G=(V,E) is a subset M of E such that no two edges of M are adjac...
Wiener index is one of the most well known and studied chemical indices. The extremal problems of fi...
15 p.The 2-methyl alkanes, the cyclic alkanes, and the 1-methyl bicyclo[X.1.0] alkanes are shown to ...
AbstractThe Harary index is defined as the sum of reciprocals of distances between all pairs of vert...
DOI
Add to ORKG