Results 81 to 90 of about 268,469 (172)

Hosoya polynomials of the capped zig-zag nanotubes

open access: yes, 2012
The Hosoya polynomial of a graph G is defined as H (G, x) = Sigma(k >= 0) d(G, k)x(k), where d(G, k) is the number of the vertex pairs at distance k in G.
Lin, Xiaoxia, 郭晓峰, Guo, Xiaofeng
core  

A novel perspective for M-polynomials to compute molecular descriptors of borophene nanosheet. [PDF]

open access: yesSci Rep, 2023
Ismail R   +6 more
europepmc   +1 more source

Hosoya Indices of Bicyclic Graphs [PDF]

open access: yes, 2009
Given a molecular graph G, the Hosoya index Z(G) of G is defined as the total number of the matchings of the graph. Let Bn denote the set of bicyclic graphs on n vertices.
Zhu, Zhongxun, Li, Shuchao, Li, Xuechao
core   +1 more source

Several Zagreb indices of power graphs of finite non-abelian groups. [PDF]

open access: yesHeliyon, 2023
Ismail R   +5 more
europepmc   +1 more source

Solution of polynomial Lyapunov and Sylvester equations

open access: yes, 2006
A two-variable polynomial approach to solve the one-variable polynomial Lyapunov and Sylvester equations is proposed. Lifting the problem from the one-variable to the two-variable context gives rise to associated lifted equations which live on finite ...
Peeters, Ralf, Rapisarda, Paolo
core   +1 more source

Polynomial Poisson algebras: Gel'fand-Kirillov problem and Poisson spectra [PDF]

open access: yes, 2014
We study the fields of fractions and the Poisson spectra of polynomial Poisson algebras. First we investigate a Poisson birational equivalence problem for polynomial Poisson algebras over a field of arbitrary characteristic.
Lecoutre, César
core  

Circular Bernstein polynomial distributions [PDF]

open access: yes
This paper introduces a new non-parametric approach to the modeling of circular data, based on the use of Bernstein polynomial densities which generalizes the standard Bernstein polynomial model to account for the specific characteristics of circular ...
José Antonio Carnicero   +2 more
core  

Home - About - Disclaimer - Privacy