Porous material such as metal-natural constructions and their particular partner poly-hydra are made up of inorganic clusters with no saturation exhibit great capability for utilization in the absorption gas ascending opening optics detecting biotechnology hardware. Cuboctahedral bi-metallic structure is an often-quoted example polyhedra class. In this study, we have calculated first second Zag...

a lot of research and various techniques have been devoted for finding the topologicaldescriptor wiener index, but most of them deal with only particular cases. there exist threeregular plane tessellations, composed of the same kind of regular polygons namely triangular,square, and hexagonal. using edge congestion-sum problem, we devise a method to computethe wiener index and demonstrate this m...

The technique of securing information or data in the form images, codes, merging words etc are closely related to disciplines cryptanalysis and cryptology. Analogous this numerical encoding chemical structure, connected topological indices is also growing significantly field graph theory. One salient features predict characteristics prescribed by molecule's structure. In paper, we calculate two...

Recently two new degree concepts have been defined in graph theory: ev-degree and ve-degree. Also the evdegree and ve-degree Zagreb and Randić indices have been defined very recently as parallel of the classical definitions of Zagreb and Randić indices. It was shown that ev-degree and ve-degree topological indices can be used as possible tools in QSPR researches . In this paper we d...

Assuming that G is a finite group and H subgroup of G, the graph known as relative coprime with respect to (denoted Γ_(G,H)) has vertices corresponding elements G. Two distinct x y are adjacent by an edge if only (|x|,|y|)=1 or belongs H. This paper will focus on finding general formula for some topological indices dihedral group. The study in theory offers valuable insights into structural pro...

We present new infinite families of expander graphs of vertex degree 4, which is the minimal possible degree for Cayley graph expanders. Our first family defines a tower of coverings (with covering indices equals 2) and our second family is given as Cayley graphs of finite groups with very short presentations with only 2 generators and 4 relations. Both families are based on particular finite q...

In this paper we present a coder for polygon mesh connectivity that delivers the best connectivity compression rates meshes reported so far. Our coder is an extension of the vertex-based coder for triangle mesh connectivity by Touma and Gotsman [26]. We code polygonal connectivity as a sequence of face and vertex degrees and exploit the correlation between them for mutual predictive compression...

Topological indices have important role in theoretical chemistry for QSPR researches. Among the all topological indices the Randić and the Zagreb indices have been used more considerably than any other topological indices in chemical and mathematical literature. Most of the topological indices as in the Randić and the Zagreb indices are based on the degrees of the vertices of a connected graph....