نتایج جستجو برای: Distance (in Graphs)
تعداد نتایج: 17028131 فیلتر نتایج به سال:
let $g$ be an $(n,m)$-graph. we say that $g$ has property $(ast)$if for every pair of its adjacent vertices $x$ and $y$, thereexists a vertex $z$, such that $z$ is not adjacentto either $x$ or $y$. if the graph $g$ has property $(ast)$, thenits complement $overline g$ is connected, has diameter 2, and itswiener index is equal to $binom{n}{2}+m$, i.e., the wiener indexis insensitive of any other...
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$ ...
distance-balanced graphs are introduced as graphs in which every edge uv has the followingproperty: the number of vertices closer to u than to v is equal to the number of vertices closerto v than to u. basic properties of these graphs are obtained. in this paper, we study theconditions under which some graph operations produce a distance-balanced graph.
in this paper, the degree distance and the gutman index of the corona product of two graphs are determined. using the results obtained, the exact degree distance and gutman index of certain classes of graphs are computed.
target tracking is the tracking of an object in an image sequence. target tracking in image sequence consists of two different parts: 1- moving target detection 2- tracking of moving target. in some of the tracking algorithms these two parts are combined as a single algorithm. the main goal in this thesis is to provide a new framework for effective tracking of different kinds of moving target...
Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. In this paper, we study the conditions under which some graph operations produce a distance-balanced graph.
In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...
the degree kirchhoff index of a connected graph $g$ is defined as the sum of the terms $d_i,d_j,r_{ij}$ over all pairs of vertices, where $d_i$ is the degree of the $i$-th vertex, and $r_{ij}$ the resistance distance between the $i$-th and $j$-th vertex of $g$. bounds for the degree kirchhoff index of the line and para-line graphs are determined. the special case of regular grap...
In $1994,$ degree distance of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the multiplicative version of degree distance and multiplicative ver...
there is no doubt that human being needs to become integrated with industry and industry needs to be progressed, daily. on the other hand, serious events in industrial units specially in oil industries has been shown that such damages and events are industry related ones. the consequence of such events and damages which resulted in chemical and poisoned explosions and loss of life and property ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید