The topological approaches to find solutions of a coincidence equation f1(x)= f2(x) can roughly be divided into degree and index theories. We describe how these methods can be combined. We are led to a concept of an extended degree theory for function triples which turns out to be natural in many respects. In particular, this approach is useful to find solutions of inclusion problems F(x)∈Φ(x)....

Gaussian network model (GNM) and anisotropic network model (ANM) are some of the most popular methods for the study of protein flexibility and related functions. In this work, we propose generalized GNM (gGNM) and ANM methods and show that the GNM Kirchhoff matrix can be built from the ideal low-pass filter, which is a special case of a wide class of correlation functions underpinning the linea...

We develop a mixed finite-element approximation scheme for Kirchhoff plate theory based on the reformulation of Kirchhoff plate theory of Ortiz and Morris [1]. In this reformulation the moment-equilibrium problem for the rotations is in direct analogy to the problem of incompressible two-dimensional elasticity. This analogy in turn opens the way for the application of diamond approximation sche...

Let $G$ be a graph and let $m_{ij}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The {em $M$-polynomial} of $G$ is introduced with $displaystyle{M(G;x,y) = sum_{ile j} m_{ij}(G)x^iy^j}$. It is shown that degree-based topological indices can be routinely computed from the polynomial, thus reducing the problem of their determination in each particular ca...

‎the gutman index and degree distance of a connected graph $g$ are defined as‎ ‎begin{eqnarray*}‎ ‎textrm{gut}(g)=sum_{{u,v}subseteq v(g)}d(u)d(v)d_g(u,v)‎, ‎end{eqnarray*}‎ ‎and‎ ‎begin{eqnarray*}‎ ‎dd(g)=sum_{{u,v}subseteq v(g)}(d(u)+d(v))d_g(u,v)‎, ‎end{eqnarray*}‎ ‎respectively‎, ‎where‎ ‎$d(u)$ is the degree of vertex $u$ and $d_g(u,v)$ is the distance between vertices $u$ and $v$‎. ‎in th...

in this paper, we determine the degree distance of the complement of arbitrary mycielskian graphs. it is well known that almost all graphs have diameter two. we determine this graphical invariant for the mycielskian of graphs with diameter two.

The Wiener index of a graph is the sum of all pairwise distances of vertices of the graph. In this paper we characterize the trees which minimize the Wiener index among all trees of given order and maximum degree and the trees which maximize the Wiener index among all trees of given order that have only vertices of two di erent degrees.

The Narumi–Katayama index of a graph G is equal to the product of the degrees of the vertices of G. In this paper we consider a new version of the Narumi– Katayama index in which each vertex degree d is multiplied d times. We characterize the graphs extremal w.r.t. this new topological index.

The Wiener index of a graph is defined as the sum of distances between all pairs of vertices in a connected graph. Wiener index correlates well with many physio chemical properties of organic compounds and as such has been well studied over the last quarter of a century. In this paper we prove some general results on Wiener Index for graphs using degree sequence.