نتایج جستجو برای: steiner distance in graph
تعداد نتایج: 17029596 فیلتر نتایج به سال:
the wiener index $w(g)$ of a connected graph $g$ is defined as $w(g)=sum_{u,vin v(g)}d_g(u,v)$ where $d_g(u,v)$ is the distance between the vertices $u$ and $v$ of $g$. for $ssubseteq v(g)$, the {it steiner distance/} $d(s)$ of the vertices of $s$ is the minimum size of a connected subgraph of $g$ whose vertex set is $s$. the {it $k$-th steiner wiener index/} $sw_k(g)$ of $g$ ...
the emph{harary index} $h(g)$ of a connected graph $g$ is defined as $h(g)=sum_{u,vin v(g)}frac{1}{d_g(u,v)}$ where $d_g(u,v)$ is the distance between vertices $u$ and $v$ of $g$. the steiner distance in a graph, introduced by chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. for a connected graph $g$ of order at least $2$ and $ssubseteq v(g)$, th...
The emph{Harary index} $H(G)$ of a connected graph $G$ is defined as $H(G)=sum_{u,vin V(G)}frac{1}{d_G(u,v)}$ where $d_G(u,v)$ is the distance between vertices $u$ and $v$ of $G$. The Steiner distance in a graph, introduced by Chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least $2$ ...
the harary index h can be viewed as a molecular structure descriptor composed of increments representing interactions between pairs of atoms, such that their magnitude decreases with the increasing distance between the respective two atoms. a generalization of the harary index, denoted by hk, is achieved by employing the steiner-type distance between k-tuples of atoms. we show that the linear c...
The Steiner distance of a graph, introduced by Chartrand, Oellermann, Tian and Zou in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least $2$ and $Ssubseteq V(G)$, the Steiner distance $d(S)$ among the vertices of $S$ is the minimum size among all connected subgraphs whose vertex sets contain $S$. Let $...
For a connected graph G and an non-empty set S ⊆ V (G), the Steiner distance dG(S) among the vertices of S is defined as the minimum size among all connected subgraphs whose vertex sets contain S. This concept represents a natural generalization of the concept of classical graph distance. Recently, the Steiner Wiener index of a graph was introduced by replacing the classical graph distance used...
Let G be a connected graph and S a nonempty set of vertices of G. Then the Steiner distance d,(S) of S is the smallest number of edges in a connected subgraph of G that contains S. Let k, I, s and m be nonnegative integers with m > s > 2 and k and I not both 0. Then a connected graph G is said to be k-vertex I-edge (s,m)-Steiner distance stable, if for every set S of s vertices of G with d,(S) ...
For a nonempty set S of vertices of a connected graph G, the Steiner distance d(S) of S is the minimum size among all connected subgraphs whose vertex set contains S. For an ordered set W = {Wl, W2,"', Wk} of vertices in a connected graph G and a vertex v of G, the Steiner representation s(vIW) of v with respect to W is the (2k I)-vector where d i1 ,i2, ... ,ij(V) is the Steiner distance d({V,W...
This paper discusses an approach for object detection and classification. Object detection approaches find the object or objects of the real world present either in a digital image or a video, where the object can belong to any class of objects. Humans can detect the objects present in an image or video quite easily but it is not so easy to do the same by machine, for this, it is necessary to m...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید