Time-Optimal Trajectory Planning Method for Servo PMSM Based on Short-Term Dynamic Feasible Region Constraint. [PDF]
Li H +5 more
europepmc +1 more source
A Spectral-Emissivity-Corrected Method for Temperature Inversion from CCD Images. [PDF]
Zhao M +7 more
europepmc +1 more source
Objective-Subjective Socioeconomic Status Configurations, Self-Acceptance, and Adolescent Prosocial Moral Reasoning: A Response Surface Analysis. [PDF]
Li X, Zhang J, Zhao X, Guo C.
europepmc +1 more source
Resonance transformations for the ( 2 , 2 p + 1 ) minimal string via x - y swap: a proof of Artemev's conjecture. [PDF]
Dekinga K, Shadrin S, Verlinde E.
europepmc +1 more source
Nonlinear Digital Self-Interference Cancellation in In-Band Full-Duplex Systems with Complex-Valued Temporal Convolution. [PDF]
Chen J, Wang X, Wang R, Zhao H.
europepmc +1 more source
Related searches:
M-polynomial and neighborhood M-polynomial methods for topological indices of porous graphene
The European Physical Journal Plus, 2021A molecular structure can be described by a parameter, polynomial or matrix. The physico-chemical features, bio-activities of a chemical compound are predicted using the numerical descriptor called topological index. Topological indices remodel the data of molecular graphs into numerical characteristics which in turn improvises the discussion of ...
M. C. Shanmukha +3 more
openaire +1 more source
The M-polynomials of some Chemical Graphs
RESEARCH REVIEW International Journal of Multidisciplinary, 2022The chemical graph theory (CGT)is one of the branches in mathematical chemistry. It is utilized to address the number of problems related to molecular theory which has its utilization in graph theory as an application. The CGT reduces the structure of the molecule to a single value which is used to mark either to its structural fragments, orbital’s ...
null B. K. Divyashree +2 more
openaire +1 more source
On the \(M\)-polynomial of planar chemical graphs
2020Summary: Let \(G\) be a graph and let \(m_{i,j}(G)\), \(i,j\geq 1\), be the number of edges \(uv\) of \(G\) such that \(\{d_v(G), d_u(G)\} = \{i,j\}\). The \(M\)-polynomial of \(G\) is \(M(G;x,y) = \sum_{i\leq j} m_{i,j}(G)x^iy^j\). With \(M(G;x,y)\) in hands, numerous degree-based topological indices of \(G\) can be routinely computed.
Deutsch, Emeric, Klavžar, Sandi
openaire +1 more source
M-Polynomial and topological indices of book graph
Journal of Discrete Mathematical Sciences and Cryptography, 2020By utilizing the degree of the vertex of the graphs, M-polynomials of book graph obtained and examined in this paper.
Abdul Jalil M. Khalaf +4 more
openaire +1 more source

