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
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 Estrada index of a graph G is defined as EE(G)=∑i=1neλi, where λ1,λ2,…,λn are the eigenv...
AbstractLet H be a hexagonal chain. Gutman [I. Gutman, Topological properties of benzenoid systems, ...
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...
AbstractLet T be an acyclic graph without perfect matching and Z(T) be its Hosoya index; let Fn be t...
AbstractThe Hosoya index and the Merrifield–Simmons index of a graph are defined as the total number...
The Hosoya index of a (molecular) graph is defined as the total number of the matchings, including t...
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...
AbstractThe Hosoya index of a graph is defined as the total number of its matchings. In this paper, ...
AbstractIt is well known that the two graph invariants, “the Merrifield–Simmons index” and “the Hoso...
We characterize the extremal trees that maximize the number of almost-perfect matchings, which are m...
The Hosoya index of a graph is defined by the total number of the matchings of the graph. In this pa...
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 Estrada index of a graph G is defined as EE(G)=∑i=1neλi, where λ1,λ2,…,λn are the eigenv...
AbstractLet H be a hexagonal chain. Gutman [I. Gutman, Topological properties of benzenoid systems, ...
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...
AbstractLet T be an acyclic graph without perfect matching and Z(T) be its Hosoya index; let Fn be t...
AbstractThe Hosoya index and the Merrifield–Simmons index of a graph are defined as the total number...
The Hosoya index of a (molecular) graph is defined as the total number of the matchings, including t...
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...
AbstractThe Hosoya index of a graph is defined as the total number of its matchings. In this paper, ...
AbstractIt is well known that the two graph invariants, “the Merrifield–Simmons index” and “the Hoso...
We characterize the extremal trees that maximize the number of almost-perfect matchings, which are m...
The Hosoya index of a graph is defined by the total number of the matchings of the graph. In this pa...
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 Estrada index of a graph G is defined as EE(G)=∑i=1neλi, where λ1,λ2,…,λn are the eigenv...
AbstractLet H be a hexagonal chain. Gutman [I. Gutman, Topological properties of benzenoid systems, ...
DOI
Add to ORKG