Javascript must be enabled to continue!
A Note on Wiener and Hyper-Wiener Indices of Abid-Waheed Graph
View through CrossRef
A Hosoya polynomial is a polynomial connected to a molecular graph, which is a graph representation of a chemical compound with atoms as vertices and chemical bonds as edges. A graph invariant is the Hosoya polynomial; it is a graph attribute that does not change under graph isomorphism. It provides information about the number of unique non-empty subgraphs in a given graph. A molecular graph's size and branching complexity are determined by a topological metric known as the Wiener index. The Wiener index of each pair of vertices in a molecular network is the sum of those distances. The topological index, one of the various classes of graph invariants, is a real number related to a connected graph's structure .The goal of this article is to compute the Hosoya polynomial of some class of Abid-Waheed graph. Further, this research focused on a C++ algorithm to calculate the wiener index of and . The Wiener index (W∗I) and Hyper-Wiener index (H∗W∗I) are calculated using Hosoya polynomial (H∗-polynomial) of some family of Abid-Waheed graphs and . Illustrations and applications are given to enhance the research work.
Universal Wiser Publisher Pte. Ltd
Title: A Note on Wiener and Hyper-Wiener Indices of Abid-Waheed Graph
Description:
A Hosoya polynomial is a polynomial connected to a molecular graph, which is a graph representation of a chemical compound with atoms as vertices and chemical bonds as edges.
A graph invariant is the Hosoya polynomial; it is a graph attribute that does not change under graph isomorphism.
It provides information about the number of unique non-empty subgraphs in a given graph.
A molecular graph's size and branching complexity are determined by a topological metric known as the Wiener index.
The Wiener index of each pair of vertices in a molecular network is the sum of those distances.
The topological index, one of the various classes of graph invariants, is a real number related to a connected graph's structure .
The goal of this article is to compute the Hosoya polynomial of some class of Abid-Waheed graph.
Further, this research focused on a C++ algorithm to calculate the wiener index of and .
The Wiener index (W∗I) and Hyper-Wiener index (H∗W∗I) are calculated using Hosoya polynomial (H∗-polynomial) of some family of Abid-Waheed graphs and .
Illustrations and applications are given to enhance the research work.
Related Results
Ary Scheffer, een Nederlandse Fransman
Ary Scheffer, een Nederlandse Fransman
AbstractAry Scheffer (1795-1858) is so generally included in the French School (Note 2)- unsurprisingly, since his career was confined almost entirely to Paris - that the fact that...
Graph convolutional neural networks for 3D data analysis
Graph convolutional neural networks for 3D data analysis
(English) Deep Learning allows the extraction of complex features directly from raw input data, eliminating the need for hand-crafted features from the classical Machine Learning p...
Graph data warehousing
Graph data warehousing
Over the last decade, we have witnessed the emergence of networks in a wide spectrum of application domains, ranging from social and information networks to biological and transpor...
Pieter Saenredam: zijn boekenbezit en zijn relatie met de landmeter Pieter Wils
Pieter Saenredam: zijn boekenbezit en zijn relatie met de landmeter Pieter Wils
AbstractAn earlier article on Saenredam's construction drawings (Note, 1 ) left open the question of how he obtained his knowledge of perspective. His teacher Frans de Grebber (Not...
Extended BCK-Ideal Based on Single-Valued Neutrosophic Hyper BCK-Ideals
Extended BCK-Ideal Based on Single-Valued Neutrosophic Hyper BCK-Ideals
This paper introduces the concept of single-valued neutrosophic hyper \(BCK\)-subalgebras as a generalization and alternative of hyper \(BCK\)-algebras and on any given nonempty se...
Bilangan Terhubung Titik Pelangi pada Graf Garis dan Graf Tengah dari Hasil Operasi Comb Graf Bintang C<sub>3</sub> dan Graf Bintang S<sub>n</sub>
Bilangan Terhubung Titik Pelangi pada Graf Garis dan Graf Tengah dari Hasil Operasi Comb Graf Bintang C<sub>3</sub> dan Graf Bintang S<sub>n</sub>
Penelitian ini bertujuan menentukan bilangan terhubung titik pelangi (rainbow vertex connection number) pada graf garis dan graf tengah yang diperoleh dari hasil operasi comb antar...
Een serie tekeningen van Johannes Stradanus met scènes uit het leven van de Heilige Giovanni Gualberto
Een serie tekeningen van Johannes Stradanus met scènes uit het leven van de Heilige Giovanni Gualberto
AbstractAmong the extensive collection of pen sketches by Johannes Stradanus (Bruges 1523-Florence 1605) in the Cooper-Hewitt Museum of Design and the Pierpont Morgan Library in Ne...
Bootstrapping a Biodiversity Knowledge Graph
Bootstrapping a Biodiversity Knowledge Graph
The "biodiversity knowledge graph" is a nice metaphor for connecting biodiversity data sources, but can we actually build it? Do we have sufficient linked data available? Given tha...

