Matching Polynomial-Based Similarity Matrices and Descriptors for Isomers of Fullerenes
نویسندگان
چکیده
I have computed the matching polynomials of a number isomers fullerenes various sizes with objective developing molecular descriptors and similarity measures for on basis their polynomials. Two novel polynomial-based topological are developed, they demonstrated to discriminating power contrast closely related fullerenes. The ways place up seven disjoint dimers fullerene shown be identical, as not structure-dependent. Moreover, matrices that provide quantitative among given set developed from robust similarity.
منابع مشابه
New Expansion for Certain Isomers of Various Classes of Fullerenes
This paper is dedicated to propose an algorithm in order to generate the certain isomers of some well-known fullerene bases. Furthermore, we enlist the bipartite edge frustration correlated with some of symmetrically distinct innite families of fullerenes generated by the oered process.
متن کاملEvaluation of Similarity Measures for Template Matching
Image matching is a critical process in various photogrammetry, computer vision and remote sensing applications such as image registration, 3D model reconstruction, change detection, image fusion, pattern recognition, autonomous navigation, and digital elevation model (DEM) generation and orientation. The primary goal of the image matching process is to establish the correspondence between two ...
متن کاملnew expansion for certain isomers of various classes of fullerenes
this paper is dedicated to propose an algorithm in order to generate the certain isomers of some well-known fullerene bases. furthermore, we enlist the bipartite edge frustration correlated with some of symmetrically distinct innite families of fullerenes generated by the oered process.
متن کاملDiscrimination Power of Polynomial-Based Descriptors for Graphs by Using Functional Matrices
In this paper, we study the discrimination power of graph measures that are based on graph-theoretical matrices. The paper generalizes the work of [M. Dehmer, M. Moosbrugger. Y. Shi, Encoding structural information uniquely with polynomial-based descriptors by employing the Randić matrix, Applied Mathematics and Computation, 268(2015), 164-168]. We demonstrate that by using the new functional m...
متن کاملRelationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications
ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Inorganics (Basel)
سال: 2023
ISSN: ['2304-6740']
DOI: https://doi.org/10.3390/inorganics11080335