نتایج جستجو برای: reformulated f index
تعداد نتایج: 693297 فیلتر نتایج به سال:
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...
ion & Reformulation • Original formulation • Reformulated formulation Original problem Reformulated problem Reformulation technique The reformulation may be an approximation • Original query • Reformulated query Original space Reformulated space Φ(S l ti (P )) Solutions(Pr) o u ons o Solutions(Po) Constraint Systems Laboratory 10/1/2007 4 CP 2007 Issue: finding Ken’s house Google Maps Yahoo Maps
The F-index of a graph G is the sum of the cubes of the degrees of the vertices of G. In this paper, explicit expressions for the F-index of different transformation graphs of type Gxyz with x, y, z ∈ {−,+} are obtained. F-index for semitotal point graph and semitotal line graph are also obtained here. MSC (2010): Primary: 05C35; Secondary: 05C07, 05C40
The F-index of a graph is defined as the sum of cubes of the vertex degrees of the graph which was introduced in 1972, in the same paper where the first and second Zagreb indices were introduced. In this paper we study the F-index of four operations on graphs which were introduced by Eliasi and Taeri [M. Eliasi, B. Taeri, Four new sums of graphs and their Wiener indices, Discrete Appl. Math.157...
For an arbitrary infinite field k of characteristic p > 0, we completely describe the structure of a block of the algebraic monoid Mn(k) (all n×n matrices over k), or, equivalently, a block of the Schur algebra S(n, p), whose simple modules are indexed by p-hook partitions. This leads to a character formula for certain simple GLn(k)-modules, valid for all n and all p.
let $g=(v,e)$ be a simple graph. an edge labeling $f:eto {0,1}$ induces a vertex labeling $f^+:vtoz_2$ defined by $f^+(v)equiv sumlimits_{uvin e} f(uv)pmod{2}$ for each $v in v$, where $z_2={0,1}$ is the additive group of order 2. for $iin{0,1}$, let $e_f(i)=|f^{-1}(i)|$ and $v_f(i)=|(f^+)^{-1}(i)|$. a labeling $f$ is called edge-friendly if $|e_f(1)-e_f(0)|le 1$. $i_f(g)=v_f(...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید