نتایج جستجو برای: gutman index
تعداد نتایج: 396312 فیلتر نتایج به سال:
let $g=(v(g),e(g))$ be a simple connected graph with vertex set $v(g)$ and edge set $e(g)$. the (first) edge-hyper wiener index of the graph $g$ is defined as: $$ww_{e}(g)=sum_{{f,g}subseteq e(g)}(d_{e}(f,g|g)+d_{e}^{2}(f,g|g))=frac{1}{2}sum_{fin e(g)}(d_{e}(f|g)+d^{2}_{e}(f|g)),$$ where $d_{e}(f,g|g)$ denotes the distance between the edges $f=xy$ and $g=uv$ in $e(g)$ and $d_{e}(f|g)=s...
On page 144 of (3], a (see Gutman[l]), formulated as follows:
The energy of a graph G as chemical concept leading to HMO theory was introduced by Hückel in 1931 and developed into mathematical interpretation many years later when Gutman 1978 gave his famous definition the sum absolute values eigenvalues adjacency matrix G. One general requirements for any topological index is that similar molecules have close TI values, which called smoothness. To explore...
Since the studies of Gutman and Gutman (2, 3), measurements of the serum acid phosphatase have become a recognized and widely used ancillary procedure for the diagnosis of cancer of the prostate and a practical means for the evaluation of the functional status of the tumor in many patients with metastasizing cancer of the prostate. While an abnormally increased value of serum acid phosphatase i...
Let G be a simple graph with the vertex set V(G) and edge set E(G) respectively. The degree of a vertex v in G is the number of vertices in G which are connected to v by an edge and denoted by dG(v). A topological index is a graph invarient which is numerical parameter obtained from a graph which characterize its topology.Thus for two isomorphic graphG and H the value of a particular topologica...
Faculty of Civil and Environmental Engineering P-O Gutman 2004-02-20 Abstract When using the Pontryagin Maximum Principle in optimal control problems, the most difficult part of the numerical solution is associated with the non-linear operation of the maximization of the Hamiltonian over the control variables. For a class of problems, the optimal control vector is a vector function with continu...
Let G=(V(G),E(G)) be a simple connected graph with vertex set V(G) and edge set E(G). The (first) edge-hyper Wiener index of the graph G is defined as: $$WW_{e}(G)=sum_{{f,g}subseteq E(G)}(d_{e}(f,g|G)+d_{e}^{2}(f,g|G))=frac{1}{2}sum_{fin E(G)}(d_{e}(f|G)+d^{2}_{e}(f|G)),$$ where de(f,g|G) denotes the distance between the edges f=xy and g=uv in E(G) and de(f|G)=∑g€(G)de(f,g|G). In thi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید