نتایج جستجو برای: distance in graph
تعداد نتایج: 17028261 فیلتر نتایج به سال:
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 reciprocal degree distance (rdd), defined for a connected graph $g$ as vertex-degree-weighted sum of the reciprocal distances, that is, $rdd(g) =sumlimits_{u,vin v(g)}frac{d_g(u) + d_g(v)}{d_g(u,v)}.$ the reciprocal degree distance is a weight version of the harary index, just as the degree distance is a weight version of the wiener index. in this paper, we present exact formu...
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$ ...
edge distance-balanced graphs are graphs in which for every edge $e = uv$ the number of edges closer to vertex $u$ than to vertex $v$ is equal to the number of edges closer to $v$ than to $u$. in this paper, we study this property under some graph operations.
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...
the $k$-th semi total point graph $r^k(g)$ of a graph $g$, is a graph obtained from $g$ by adding $k$ vertices corresponding to each edge and connecting them to endpoint of edge considered. in this paper, we obtain formulae for the resistance distance and kirchhoff index of $r^k(g)$.
boron nitride semiconducting zigzag swcnt, $b_{cb}$$n_{cn}$$c_{1-cb-cn}$, as a potential candidate for making nanoelectronic devices was examined. in contrast to the previous dft calculations, wherein just one boron and nitrogen doping configuration have been considered, here for the average over all possible configurations, density of states (dos) was calculated in terms of boron and nitrogen ...
Let G be a connected simple (molecular) graph. The distance d(u, v) between two vertices u and v of G is equal to the length of a shortest path that connects u and v. In this paper we compute some distance based topological indices of H-Phenylenic nanotorus. At first we obtain an exact formula for the Wiener index. As application we calculate the Schultz index and modified Schultz index of this...
The textit{metric dimension} of a connected graph $G$ is the minimum number of vertices in a subset $B$ of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $B$. In this case, $B$ is called a textit{metric basis} for $G$. The textit{basic distance} of a metric two dimensional graph $G$ is the distance between the elements of $B$. Givi...
A {it topological index} of a graph is a real number related to the graph; it does not depend on labeling or pictorial representation of a graph. In this paper, we present the upper bounds for the product version of reciprocal degree distance of the tensor product, join and strong product of two graphs in terms of other graph invariants including the Harary index and Zagreb indices.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید