Some Applications of Wagner's Weighted Subgraph Counting Polynomial

We use Wagner's weighted subgraph counting polynomial to prove that the partition function of the anti-ferromagnetic Ising model on line graphs is real rooted and to prove that roots of the edge cover polynomial have absolute value at most $4$. We more generally show that roots of the edge cover polynomial of a $k$-uniform hypergraph have absolute value at most $2^k$, and discuss applications of this to the roots of domination polynomials of graphs. We moreover discuss how our results relate to efficient algorithms for approximately computing evaluations of these polynomials.

Forgotten Index of Generalized Operations on Graphs

In theoretical chemistry, several distance-based, degree-based, and counting polynomial-related topological indices (TIs) are used to investigate the different chemical and structural properties of the molecular graphs. Furtula and Gutman redefined the F -index as the sum of cubes of degrees of the vertices of the molecular graphs to study the different properties of their structure-dependency. In this paper, we compute F -index of generalized sum graphs in terms of various TIs of their factor graphs, where generalized sum graphs are obtained by using four generalized subdivision-related operations and the strong product of graphs. We have analyzed our results through the numerical tables and the graphical presentations for the particular generalized sum graphs constructed with the help of path (alkane) graphs.

Orbit Polynomial of Graphs versus Polynomial with Integer Coefficients

Suppose ai indicates the number of orbits of size i in graph G. A new counting polynomial, namely an orbit polynomial, is defined as OG(x) = ∑i aixi. Its modified version is obtained by subtracting the orbit polynomial from 1. In the present paper, we studied the conditions under which an integer polynomial can arise as an orbit polynomial of a graph. Additionally, we surveyed graphs with a small number of orbits and characterized several classes of graphs with respect to their orbit polynomials.

On the Degeneracy of the Orbit Polynomial and Related Graph Polynomials

The orbit polynomial is a new graph counting polynomial which is defined as OG(x)=∑i=1rx|Oi|, where O1, …, Or are all vertex orbits of the graph G. In this article, we investigate the structural properties of the automorphism group of a graph by using several novel counting polynomials. Besides, we explore the orbit polynomial of a graph operation. Indeed, we compare the degeneracy of the orbit polynomial with a new graph polynomial based on both eigenvalues of a graph and the size of orbits.

On Certain Counting Polynomial of Titanium Dioxide Nanotubes

Background: In 1936, Polya introduced the concept of a counting polynomial in chemistry. However, the subject established little attention from chemists for some decades even though the spectra of the characteristic polynomial of graphs were considered extensively by numerical means in order to obtain the molecular orbitals of unsaturated hydrocarbons. Counting polynomial is a sequence representation of a topological stuff so that the exponents precise the magnitude of its partitions while the coefficients are correlated to the occurrence of these partitions. Counting polynomials play a vital role in topological description of bipartite structures as well as counts of equidistant and non-equidistant edges in graphs. Omega, Sadhana, PI polynomials are wide examples of counting polynomials. Methods: Mathematical chemistry is a division of abstract chemistry in which we debate and forecast the chemical structure by using mathematical models. Chemical graph theory is a subdivision of mathematical chemistry in which the structure of a chemical compound can be embodied by a labelled graph whose vertices are atoms and edges are covalent bonds between the atoms. We use graph theoretic technique in finding the counting polynomials of TiO2 nanotubes. : Let ! be the molecular graph of TiO2. Then (!, !) = !!10!!+8!−2!−2 + (2! +1) !10!!+8!−2! + 2(! + 1)10!!+8!−2 Results: In this paper, the omega, Sadhana and PI counting polynomials are studied. These polynomials are useful in determining the omega, Sadhana and PI topological indices which play an important role in studies of Quantitative structure-activity relationship (QSAR) and Quantitative structure-property relationship (QSPR) which are used to predict the biological activities and properties of chemical compounds. Conclusion: These counting polynomials play an important role in topological description of bipartite structures as well as counts equidistance and non-equidistance edges in graphs. Computing distancecounting polynomial is under investigation.

About the cube polynomial of Extended Fibonacci Cubes

The hypercube is one of the best model for the network topology of a distributed system. In this paper we determine the cube polynomial of Extended Fibonacci Cubes, which is the counting polynomial for the number of induced k-dimensional hypercubes in Extended Fibonacci Cubes.

Hosoya-Diudea polynomial in hyper structures

Hosoya polynomial counts finite sequences of distances in a graph G; more exactly, it counts the number of points/atoms lying at a given distance in G. The polynomial coefficients are calculable by means of layer/shell matrices. Shell matrix operator enables the transformation of any square matrix in the corresponding layer/shell matrix, thus generalizing the local property counting according to its distribution by the distances in G. This represents the “Hosoya-Diudea” generalized counting polynomial. We applied this theory to several hypothetical nanostructures with icosahedral symmetry.