Polynomials of Degree-Based Indices for Three-Dimensional Mesh Network

In order to study the behavior and interconnection of network devices,graphs structures are used to formulate the properties in terms of mathematical models.Mesh network(meshnet)is a LAN topology in which devices are connected either directly or through some intermediate devices.These terminating and intermediate devices are considered as vertices of graph whereas wired or wireless connections among these devices are shown as edges of graph.Topological indices are used to reflect structural property of graphs in form of one real number.This structural invariant has revolutionized the field of chemistry to identify molecular descriptors of chemical compounds.These indices are extensively used for establishing relationships between the structure of nanotubes and their physico-chemical properties.In this paper a representation of sodium chloride(NaCl)is studied,because structure of NaCl is same as the Cartesian product of three paths of length exactly like a mesh network.In this way the general formula obtained in this paper can be used in chemistry as well as for any degree-based topological polynomials of three-dimensional mesh networks.

Comparative Study of Valency-Based Topological Descriptor for Hexagon Star Network

A class of graph invariants referred to today as topological indices are inefficient progressively acknowledged by scientific experts and others to be integral assets in the depiction of structural phenomena.The structure of an interconnection network can be represented by a graph.In the network,vertices represent the processor nodes and edges represent the links between the processor nodes.Graph invariants play a vital feature in graph theory and distinguish the structural properties of graphs and networks.A topological descriptor is a numerical total related to a structure that portray the topology of structure and is invariant under structure automorphism.There are various uses of graph theory in the field of basic science.The main notable utilization of a topological descriptor in science was by Wiener in the investigation of paraffin breaking points.In this paper we study the topological descriptor of a newly design hexagon star network.More preciously,we have computed variation of the Randic0 R0,fourth Zagreb M4,fifth Zagreb M5,geometric-arithmetic GA;atom-bond connectivity ABC;harmonic H;symmetric division degree SDD;first redefined Zagreb,second redefined Zagreb,third redefined Zagreb,augmented Zagreb AZI,Albertson A;Irregularity measures,Reformulated Zagreb,and forgotten topological descriptors for hexagon star network.In the analysis of the quantitative structure property relationships(QSPRs)and the quantitative structure activity relationships(QSARs),graph invariants are important tools to approximate and predicate the properties of the biological and chemical compounds.We also gave the numerical and graphical representations comparisons of our different results.

Metric Basis of Four-Dimensional Klein Bottle

The Metric of a graph plays an essential role in the arrangement of different dimensional structures and finding their basis in various terms.The metric dimension of a graph is the selection of the minimum possible number of vertices so that each vertex of the graph is distinctively defined by its vector of distances to the set of selected vertices.This set of selected vertices is known as the metric basis of a graph.In applied mathematics or computer science,the topic of metric basis is considered as locating number or locating set,and it has applications in robot navigation and finding a beacon set of a computer network.Due to the vast applications of this concept in computer science,optimization problems,and also in chemistry enormous research has been conducted.To extend this research to a four-dimensional structure,we studied the metric basis of the Klein bottle and proved that the Klein bottle has a constant metric dimension for the variation of all its parameters.Although the metric basis is variying in 3 and 4 values when the values of its parameter change,it remains constant and unchanged concerning its order or number of vertices.The methodology of determining the metric basis or locating set is based on the distances of a graph.Therefore,we proved the main theorems in distance forms.

Algebraic Properties for Molecular Structure of Magnesium Iodide

As an inorganic chemical,magnesium iodide has a significant crystalline structure.It is a complex and multifunctional substance that has the potential to be used in a wide range of medical advancements.Molecular graph theory,on the other hand,provides a sufficient and cost-effective method of investigating chemical structures and networks.M-polynomial is a relatively new method for studying chemical networks and structures in molecular graph theory.It displays numerical descriptors in algebraic form and highlights molecular features in the form of a polynomial function.We present a polynomials display of magnesium iodide structure and calculate several M-polynomials in this paper,particularly the M-polynomials of the augmented Zagreb index,inverse sum index,hyper Zagreb index and for the symmetric division index.

The Kemeny’s Constant and Spanning Trees of Hexagonal Ring Network

Spanning tree(τ)has an enormous application in computer science and chemistry to determine the geometric and dynamics analysis of compact polymers.In the field of medicines,it is helpful to recognize the epidemiology of hepatitis C virus(HCV)infection.On the other hand,Kemeny’s constant(Ω)is a beneficial quantifier characterizing the universal average activities of a Markov chain.This network invariant infers the expressions of the expected number of time-steps required to trace a randomly selected terminus state since a fixed beginning state si.Levene and Loizou determined that the Kemeny’s constant can also be obtained through eigenvalues.Motivated by Levene and Loizou,we deduced the Kemeny’s constant and the number of spanning trees of hexagonal ring network by their normalized Laplacian eigenvalues and the coefficients of the characteristic polynomial.Based on the achieved results,entirely results are obtained for the M鯾ius hexagonal ring network.