Ultrashort X-ray pulses from free-electron laser X-ray sources make it feasible to conduct small- and wide-angle scattering experiments on biomolecular samples in solution at sub-picosecond timescales. During these so-called fluctuation scattering experiments, the absence of rotational averaging, typically induced by Brownian motion in classic solution-scattering experiments, increases the info...

We proposed a new approach to compare profiles when the correlations among attributes can be represented as a tree. To account for these correlations, the profile is extended with new bits corresponding to the internal nodes of the tree, which encode the correlations. An ad hoc scoring scheme is adopted for measuring the similarity among these extended profiles, and the scores thus obtained are...

Suppose G is an nvertex and medge simple graph with edge set E(G). An integervalued function f: E(G) → Z is called a flow. Tutte was introduced the flow polynomial F(G, λ) as a polynomial in an indeterminate λ with integer coefficients by F(G,λ) In this paper the Flow polynomial of some dendrimers are computed.

The Tutte polynomial of a graph G, T(G, x,y) is a polynomial in two variables defined for every undirected graph contains information about how the graph is connected. In this paper a simple formula for computing Tutte polynomial of a benzenoid chain is presented.

In this paper, we establish some Bernstein type inequalities for the complex polynomial. Our results constitute generalizations and refinements of some well-known polynomial inequalities.

Since the celebrated PPAD-completeness result for Nash equilibria in bimatrix games, a long line of research has focused on polynomial-time algorithms that compute ε-approximate equilibria. Finding best possible approximation guarantee we can have polynomial time been fundamental and non-trivial pursuit settling complexity approximate Despite significant amount effort, algorithm Tsaknakis Spira...

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...

‎    The Narumi-Katayama index is the first topological index defined by the product of some graph theoretical quantities. Let G be a simple graph. Narumi-Katayama index of G is defined as the product of the degrees of the vertices of G. In this paper, we define the Narumi-Katayama polynomial of G. Next, we investigate some properties of this polynomial for graphs and then, we obtain ...