نتایج جستجو برای: reveres wiener indices
تعداد نتایج: 90442 فیلتر نتایج به سال:
the vertex-edge wiener index of a simple connected graph g is defined as the sum of distances between vertices and edges of g. two possible distances d_1(u,e|g) and d_2(u,e|g) between a vertex u and an edge e of g were considered in the literature and according to them, the corresponding vertex-edge wiener indices w_{ve_1}(g) and w_{ve_2}(g) were introduced. in this paper, we present exact form...
Complex networks are ubiquitous in biological, physical and social sciences. Network robustness research aims at finding a measure to quantify network robustness. A number of Wiener type indices have recently been incorporated as distance-based descriptors of complex networks. Wiener type indices are known to depend both on the network's number of nodes and topology. The Wiener polarity index i...
The reverse Wiener index of a connected graph G is defined as Λ(G) = 1 2 n(n− 1)d−W (G), where n is the number of vertices, d is the diameter, and W (G) is the Wiener index (the sum of distances between all unordered pairs of vertices) of G. We determine the n-vertex non-starlike trees with the first four largest reverse Wiener indices for n > 8, and the nvertex non-starlike non-caterpillar tre...
Abstract. In this paper Reverse Wiener index, Reverse Detour Wiener index, Reverse Circular Wiener index Reverse Harary index, Reverse Detour Harary index, Reverse Circular Harary index, Reverse Reciprocal Wiener index, Reverse Detour Reciprocal Wiener index, Reverse Circular Reciprocal Wiener index, Reverse Hyper Wiener index, Reverse, Detour Hyper Wiener index, Reverse Circular Hyper Wiener i...
The unitary Cayley graph Xn has vertex set Zn = {0, 1,…, n-1} and vertices u and v are adjacent, if gcd(uv, n) = 1. In [A. Ilić, The energy of unitary Cayley graphs, Linear Algebra Appl. 431 (2009) 1881–1889], the energy of unitary Cayley graphs is computed. In this paper the Wiener and hyperWiener index of Xn is computed.
wiener index is a topological index based on distance between every pair of vertices in agraph g. it was introduced in 1947 by one of the pioneer of this area e.g, harold wiener. inthe present paper, by using a new method introduced by klavžar we compute the wiener andszeged indices of some nanostar dendrimers.
The vertex-edge Wiener index of a simple connected graph G is defined as the sum of distances between vertices and edges of G. Two possible distances D_1(u,e|G) and D_2(u,e|G) between a vertex u and an edge e of G were considered in the literature and according to them, the corresponding vertex-edge Wiener indices W_{ve_1}(G) and W_{ve_2}(G) were introduced. In this paper, we present exact form...
The Wiener index of a connected graph G, denoted by W (G), is defined as 12 ∑ u,v∈V (G) dG(u, v). Similarly, the hyper-Wiener index of a connected graph G, denoted by WW (G), is defined as 1 2W (G) + 1 4 ∑ u,v∈V (G) dG(u, v). The vertex Padmakar-Ivan (vertex PI) index of a graph G is the sum over all edges uv of G of the number of vertices which are not equidistant from u and v. In this paper, ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید