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.

Longtail Tuna (Thunnus tonggol) Consumption Frequency in Terengganu, Malaysia

In Terengganu, Longtail tuna or Thunnus tonggol is one of the most popular marine fishes landed by fishermen and has a high demand among customers. This species often served with a unique local delicacy called Nasi Dagang and Ikan Singgang, one of the favourite meals during breakfast by local communities. Since people have always consumed this species, therefore this study aims to identify the consumption rate of this species among Terengganu people. Specifically, this survey data obtained from 124 respondents, ages ranged from 15 to 60 years old from five districts in Terengganu, including Besut, Kuala Nerus, Kuala Terengganu, Hulu Terengganu, and Kemaman. Generally, the estimated amount of this species consumption is 239.7 g per person and 1.83 times per week. From the formula calculated, the amount of this species consumed by one person is 437.4 g/person/week. This value can use to calculate the permissible tolerable weekly intake (PTWI) to estimate the intake of pollutants, such as heavy metals in the human body.

低秩矩阵恢复模型改进及其在石油测井中的应用

传统的低秩矩阵恢复模型在去噪过程中通过将观测矩阵分解为低秩部分和稀疏部分达到噪声去除的目的,但该模型要求噪声矩阵必须是稀疏的。然而石油测井所获得的数据中噪声来源复杂,并不能完全保证噪声分布满足稀疏性的要求,使该模型在去噪时表现出一定的局限性,去噪效果不稳定,进而导致后续的数据处理准确率降低。为此,提出将加权范数的思想应用于传统的低秩矩阵恢复模型中,并在惩罚项中将F范数与待恢复矩阵的核范数相结合,构造改进的低秩矩阵恢复模型,使其能够在保证解的稳定性的同时,可以更好地挖掘观测矩阵的低秩性以及增强稀疏矩阵的稀疏性。通过非精确的拉格朗日乘子法分别对改进前后的模型进行求解,并对两种模型去噪后的测井数据分别采用支持向量机(SVM)和相关向量机(RVM)进行油气层识别,结果表明经改进的低秩矩阵恢复模型去噪后的测井数据在保证了油气层识别效率的同时,识别准确率上有了明显提升。

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.

A Study of Cellular Neural Networks with Vertex-Edge Topological Descriptors

The CellularNeuralNetwork(CNN)has various parallel processing applications,image processing,non-linear processing,geometric maps,highspeed computations.It is an analog paradigm,consists of an array of cells that are interconnected locally.Cells can be arranged in different configurations.Each cell has an input,a state,and an output.The cellular neural network allows cells to communicate with the neighbor cells only.It can be represented graphically;cells will represent by vertices and their interconnections will represent by edges.In chemical graph theory,topological descriptors are used to study graph structure and their biological activities.It is a single value that characterizes the whole graph.In this article,the vertex-edge topological descriptors have been calculated for cellular neural network.Results can be used for cellular neural network of any size.This will enhance the applications of cellular neural network in image processing,solving partial differential equations,analyzing 3D surfaces,sensory-motor organs,and modeling biological vision.

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.

ON CLASSES OF REGULAR GRAPHS WITH CONSTANT METRIC DIMENSION

In this paper, we are dealing with the study of the metric dimension of some classes of regular graphs by considering a class of bridgeless cubic graphs called the flower snarks Jn, a class of cubic convex polytopes considering the open problem raised in [M. Imran et al., families of plane graphs with constant metric dimension, Utilitas Math., in press] and finally Harary graphs H5,n by partially answering to an open problem proposed in Ⅱ. Javaid et al., Families of regular graphs with constant metric dimension, Utilitas Math., 2012, 88： 43-57]. We prove that these classes of regular graphs have constant metric dimension.

Analysis of Distance-Based Topological Polynomials Associated with Zero-Divisor Graphs

Chemical compounds are modeled as graphs.The atoms of molecules represent the graph vertices while chemical bonds between the atoms express the edges.The topological indices representing the molecular graph corresponds to the different chemical properties of compounds.Let a,b be are two positive integers,andΓ(Z_(a)×Z_(b))be the zero-divisor graph of the commutative ring Z_(a)×Z_(b).In this article some direct questions have been answered that can be utilized latterly in different applications.This study starts with simple computations,leading to a quite complex ring theoretic problems to prove certain properties.The theory of finite commutative rings is useful due to its different applications in the fields of advanced mechanics,communication theory,cryptography,combinatorics,algorithms analysis,and engineering.In this paper we determine the distance-based topological polynomials and indices of the zero-divisor graph of the commutative ring Z_(p^(2))×Z_(q)(for p,q as prime numbers)with the help of graphical structure analysis.The study outcomes help in understanding the fundamental relation between ring-theoretic and graph-theoretic properties of a zero-divisor graphΓ(G).

Metric-Based Resolvability of Quartz Structure

Silica has three major varieties of crystalline. Quartz is the main andabundant ingredient in the crust of our earth. While other varieties are formedby the heating of quartz. Silica quartz is a rich chemical structure containingenormous properties. Any chemical network or structure can be transformedinto a graph, where atoms become vertices and the bonds are converted toedges, between vertices. This makes a complex network easy to visualize towork on it. There are many concepts to work on chemical structures in termsof graph theory but the resolvability parameters of a graph are quite advanceand applicable topic. Resolvability parameters of a graph is a way to getting agraph into unique form, like each vertex or edge has a unique identification bymeans of some selected vertices, which depends on the distance of vertices andits pattern in a particular graph. We have dealt some resolvability parametersof SiO2 quartz. We computed the resolving set for quartz structure and itsvariants, wherein we proved that all the variants of resolvability parameters ofquartz structures are constant and do not depend on the order of the graph.

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.

On Vertex-Edge-Degree Topological Descriptors for Certain Crystal Networks

Due to the combinatorial nature of graphs they are used easily in pure sciences and social sciences.The dynamical arrangement of vertices and their associated edges make them flexible(like liquid)to attain the shape of any physical structure or phenomenon easily.In the field of ICT they are used to reflect distributed component and communication among them.Mathematical chemistry is another interesting domain of applied mathematics that endeavors to display the structure of compounds that are formed in result of chemical reactions.This area attracts the researchers due to its applications in theoretical and organic chemistry.It also inspires the mathematicians due to involvement of mathematical structures.Regular or irregular bonding ability of molecules and their formation of chemical compounds can be analyzed using atomic valences(vertex degrees).Pictorial representation of these compounds helps in identifying their properties by computing different graph invariants that is really considered as an application of graph theory.This paper reflects the work on topological indices such as ev-degree Zagreb index,the first ve-degree Zagrebindex,the first ve-degree Zagrebindex,the second ve-degree Zagreb index,ve-degree Randic index,the ev-degree Randic index,the ve-degree atom-bond connectivity index,the ve-degree geometric-arithmetic index,the ve-degree harmonic index and the ve-degree sum-connectivity index for crystal structural networks namely,bismuth tri-iodide and lead chloride.In this article we have determine the exact values of ve-degree and ev-degree based topological descriptors for crystal networks.

Vertex-Edge Degree Based Indices of Honey Comb Derived Network

Chemical graph theory is a branch of mathematics which combines graph theory and chemistry.Chemical reaction network theory is a territory of applied mathematics that endeavors to display the conduct of genuine compound frameworks.It pulled the research community due to its applications in theoretical and organic chemistry since 1960.Additionally,it also increases the interest the mathematicians due to the interesting mathematical structures and problems are involved.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.In this paper,we determined the newly introduced topological indices namely,first ve-degree Zagreb?index,first ve-degree Zagreb?index,second ve-degree Zagreb index,ve-degree Randic index,ve-degree atom-bond connectivity index,ve-degree geometric-arithmetic index,ve-degree harmonic index and ve-degree sum-connectivity index for honey comb derived 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.Also,we give the numerical and graphical representation of our outcomes.

On Edge Irregular Reflexive Labeling of Categorical Product of Two Paths

Among the huge diversity of ideas that show up while studying graph theory,one that has obtained a lot of popularity is the concept of labelings of graphs.Graph labelings give valuable mathematical models for a wide scope of applications in high technologies(cryptography,astronomy,data security,various coding theory problems,communication networks,etc.).A labeling or a valuation of a graph is any mapping that sends a certain set of graph elements to a certain set of numbers subject to certain conditions.Graph labeling is a mapping of elements of the graph,i.e.,vertex and for edges to a set of numbers(usually positive integers),called labels.If the domain is the vertex-set or the edge-set,the labelings are called vertex labelings or edge labelings respectively.Similarly,if the domain is V(G)[E(G)],then the labeling is called total labeling.A reflexive edge irregular k-labeling of graph introduced by Tanna et al.:A total labeling of graph such that for any two different edges ab and a'b'of the graph their weights has wt_(x)(ab)=x(a)+x(ab)+x(b) and wt_(x)(a'b')=x(a')+x(a'b')+x(b') are distinct.The smallest value of k for which such labeling exist is called the reflexive edge strength of the graph and is denoted by res(G).In this paper we have found the exact value of the reflexive edge irregularity strength of the categorical product of two paths (P_(a)×P_(b))for any choice of a≥3 and b≥3.

Vertex-antimagic Labelings of Regular Graphs

Let G = （V, E） be a finite, simple and undirected graph with p vertices and q edges. An （a, d）-vertex-antimagic total labeling of G is a bijection f from V（G） t2 E（G） onto the set of consecutive integers 1, 2,... ,p ＋ q, such that the vertex-weights form an arithmetic progression with the initial term a and difference d, where the vertex-weight of x is the sum of the value f（x） assigned to the vertex x together with all values f（xy） assigned to edges xy incident to x. Such labeling is called super if the smallest possible labels appear on the vertices. In this paper, we study the properties of such labelings and examine their existence for 2r-regular graphs when the difference d is 0, 1,..., r ＋ 1.