Szeged polynomial and edge Szeged polynomial aredistance-based topological parameters which reflect certain structural features of organic molecules. Each structural feature of such organic moleculecan be expressed as a…
molecular graph, and can be different structures. In this paper, we determine the Shultz polynomial andmodified Shultz polynomial of fanmolecular graph, wheel molecular graph, gear fan molecular graph, gear wheel
present methods that can be used to obtain algebraic solution of polynomial equations of degree five and above. In this contribution I look into methods by which higher degree polynomial ... selection of the appropriate…
quantity related to G which is invariant under automorphisms of G. A new counting polynomial, called the Omega polynomial, was recently proposed by Diudea on the ground of quasi-orthogonal ... edge strips in a…
determine the effect of selecting the initial value on the root of a polynomial equation that has multiple roots. There are three methods used, namely the Brent method, the bisection ... know the performance of the…
numeric quantity related to G which is invariant under automorphisms of G. The Omega polynomial Ω(G,x) for counting qoc strips in G is defined ... being the number of strips of length c. Also, know that the Sadhana…
Ultraspherical polynomials Cυ(x) n (Gegenbaur polynomials) are one of the most important families of orthogonal polynomials in mathematical chemistry, mathematical physics, probability theory, differential equations…
this study, power series and shifted Chebyshev polynomials are used as basis function for solving first order volterra integro-differential equations using standard collocation method. An assumed approximate solution…
counting polynomials are useful in topological description of benzenoid structures. It also helps to describe its topological indices by virtue of quasi-orthogonal cuts of the edge strips ... this article we give a…
Every Boolean function is uniquely defined by a polynomial modulo 2. The degree of a Boolean function is the degree of its defining polynomial. In cryptography, the Boolean functions ... degrees. Therefore, in finding…
stored is selected randomly. The first method is based on a linear polynomial function and the second method is based on a quadratic polynomial function. The present work compares
Hosoya polynomial of a graph was introduced by H. Hosoya in 1988, and the most interesting application of the Hosoya polynomial is that almost all distance-based graph invariants, which ... physical, chemical and…
formula for 3 n d(P ,i). Using this recursive formula, we construct the polynomial = = ∑ n 3 3i nn i ni 7 (P ) d(P , D,ixi)x which ... call the domination polynomial of Pn3 and obtain some properties of this…
spectral reflectance reconstruction method based on combining PCA and regularized polynomial is proposed to optimize the spectral data and channel response. Firstly, the PCA method is used to reduce ... high dimensional…
computational model for transform coding of colour images based on a set of orthogonal polynomials is proposed in different colour spaces. Initially, a three dimensional point spread operator is devised ... from a set…
seed germination and seedling growth. Research Methods: A mathematical model will be formulated using polynomial regression based on the data collected. This model was used instead of other proposed models ... used in…
signal compression is traditionally performed in three ways: direct, transform and parameter extraction. Polynomial approximation which is a form of parameter extraction method, is employed here. This paper proposes…
this paper, an efficient and accurate computational method based on the Genocchi polynomials is proposed for solving a class of fractional optimal control problems. In the proposed method, the Caputo ... fractional…
doing so, we could inspect whether these two polynomials can be identical when n ≥ 3, i.e., xn-an=xn-(cn-bn), which satisfies an=cn-bn. By inspecting the properties ... polynomials such as factoring, root structures and…
this paper, an algorithm is presented, solving the 3-SAT problem in a polynomial runtime of which implies P = NP. The 3-SAT problem is about determining, whether ... satisfiable. The algorithm R is similar to already…
this work, we propose a new basis of wavelets constructed using Laguerre polynomials. Several methods of wavelet construction like Daubechies, splines and coiflets are present in the literature without ... exhaustive…
For authors and organisers
Publish, present and keep up with your field
Find the right journal for your paper and submit your manuscript.