For given non-abelian group G, the non-commuting (NC)-graph $Gamma(G)$ is a graph with the vertex set $G$ $Z(G)$ and two distinct vertices $x, yin V(Gamma)$ are adjacent whenever $xy neq yx$. The aim of this paper is to compute the spectra of some well-known NC-graphs.

background: identification of disease risk factors can help in the prevention of diseases. in assessing the predictive value of continuous variables, a routine procedure is to categorize the factors. this yield to inability to detect non‑linear relationship, if exist. multivariate fractional polynomial (mfp) modeling is a flexible method to reveal non‑linear associations. we aim to demonstrate ...

This paper gives an overview of the use of Polynomial Chaos expansions to represent stochastic processes in numerical simulations. Several methods are presented to perform arithmetic on, as well as to evaluate polynomial and non-polynomial functions of variables respresented with Polynomial Chaos expansions. These methods include Taylor series, a newly developed integration method as well as a ...

the omega polynomial(x) was recently proposed by diudea, based on the length of stripsin given graph g. the sadhana polynomial has been defined to evaluate the sadhana index ofa molecular graph. the pi polynomial is another molecular descriptor. in this paper wecompute these three polynomials for some infinite classes of nanostructures.

in this paper, we show how certain metabelian groups can be found within polynomial evaluation groupoids. we show that every finite abelian group can beobtained as a polynomial evaluation groupoid.

We present separation results on genuinely (or strongly) time bounded sequential, parallel and non-deterministic complexity classes deened by RAMs with xed set of arithmetic operations. In particular, we separate non-uniform polynomial time from non-uniform parallel polynomial time for the set of operations f+; ?; g (answering a question of M 88]), and uniform deterministic polynomial time from...