In this paper, we introduce the Hosoya-Spectral indices and the Hosoya information content of a graph. The first measure combines structural information captured by partial Hosoya polynomials and graph spectra. The latter is a graph entropy measure which is based on blocks consisting of vertices with the same partial Hosoya polynomial. We evaluate the discrimination power of these quantities by interpreting numerical results
AbstractThe Hosoya index and the Merrifield–Simmons index of a graph are defined as the total number...
Let G be a graph. The distance d(u,v) between two vertices u and v of G is equal to the length of a ...
In mathematical chemistry, a topological index is a molecular descriptor that is calculated based on...
In this paper, we introduce the Hosoya-Spectral indices and the Hosoya information content of a grap...
In this paper, we introduce the Hosoya-Spectral indices and the Hosoya information content of a grap...
This paper demonstrates properties of Hosoya entropy, a quantitative measure of graph complexity bas...
We introduce a novel matrix associated with molecular graphs, the construction of which is related t...
In this paper we extend earlier results on Hosoya entropy (H-entropy) of graphs, and establish conne...
The Hosoya polynomial of a graph encompasses many of its metric properties, for instance the Wiener ...
The Hosoya polynomial of a graph G is a graphical invariant polynomial that its first derivative at ...
In the fields of chemical graph theory, topological index is a type of a molecular descriptor that i...
The Wiener index is a graph invariant that has found extensive application in chemistry. In addition...
Given a molecular graph G, the Hosoya index Z(G) of G is defined as the total number of the matching...
Abstract. The Hosoya index and the Merrifield-Simmons index are two types of graph invariants used i...
In this paper, we evaluate the uniqueness of several information-theoretic measures for graphs based...
AbstractThe Hosoya index and the Merrifield–Simmons index of a graph are defined as the total number...
Let G be a graph. The distance d(u,v) between two vertices u and v of G is equal to the length of a ...
In mathematical chemistry, a topological index is a molecular descriptor that is calculated based on...
In this paper, we introduce the Hosoya-Spectral indices and the Hosoya information content of a grap...
In this paper, we introduce the Hosoya-Spectral indices and the Hosoya information content of a grap...
This paper demonstrates properties of Hosoya entropy, a quantitative measure of graph complexity bas...
We introduce a novel matrix associated with molecular graphs, the construction of which is related t...
In this paper we extend earlier results on Hosoya entropy (H-entropy) of graphs, and establish conne...
The Hosoya polynomial of a graph encompasses many of its metric properties, for instance the Wiener ...
The Hosoya polynomial of a graph G is a graphical invariant polynomial that its first derivative at ...
In the fields of chemical graph theory, topological index is a type of a molecular descriptor that i...
The Wiener index is a graph invariant that has found extensive application in chemistry. In addition...
Given a molecular graph G, the Hosoya index Z(G) of G is defined as the total number of the matching...
Abstract. The Hosoya index and the Merrifield-Simmons index are two types of graph invariants used i...
In this paper, we evaluate the uniqueness of several information-theoretic measures for graphs based...
AbstractThe Hosoya index and the Merrifield–Simmons index of a graph are defined as the total number...
Let G be a graph. The distance d(u,v) between two vertices u and v of G is equal to the length of a ...
In mathematical chemistry, a topological index is a molecular descriptor that is calculated based on...