Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
References

Transmission in Butter y Networks

Profile image of Azubha GodwinAzubha GodwinProfile image of Sundara Rajan RSundara Rajan RProfile image of Paul ManuelPaul Manuel

Abstract

Wiener Index of a graph G is de ned as W(G) = 1 2 Σ u;v2V (G) dG(u; v). The Transmission index T(u) of a vertex u in a graph G is de ned as T(u) = Σ v2V d(u; v). The original technique for the computation of Wiener index was by brute-force method applying distance matrix. Later a new technique using convex partition was introduced and this convex partition method was shown to be more efficient than distance matrix method. However, this convex partition method is not universal. Some interesting architectures such as butter y and mesh of trees do not induce convex partition. In this paper, we introduce another partition technique to accommodate larger classes of graphs which are not solved by convex partition method. This partition technique is called transmission partition method. It is different from distance matrix method and convex partition method. We show that this new technique signi cantly reduces the time complexity to compute the Wiener index to constant time for larger classes of graphs. We demonstrate the efficiency of this technique on butter y networks by computing its Wiener index and its Transmission index in constant time.

Related papers

On Peripheral Wiener Index: Line Graphs, Zagreb Index, and Cut Method
Afework Kahsay

2018

The peripheral Wiener index, PW (G) is the sum of the distances of all pairs of vertices in the periphery of a graph G. In this paper it is shown that, an arbitrary graph G is an induced subgraph of a graph H for which PW (H) = PW (L(H)) holds, where L(K) is the line graph of K. Using Pell-like equations, infinite families of graphs G are constructed for which PW (G) = PW (L(G)) holds. A connection between the peripheral Wiener index and the Zagreb index for graphs of small diameter is presented. It is also demonstrated that the partition distance approach applicable to the peripheral Wiener index, making some earlier results as very special cases of this approach.

View PDFchevron_right
How to compute the Wiener index of a graph
Bojan Mohar

Journal of Mathematical Chemistry, 1988

The Wiener index of a graph G is equal to the sum of distances between all pairs of vertices of G, It is known that the Wiener index of a molecular graph correlates with certain physical and chemical properties of a molecule. In the mathematical literature, many good algorithms can be found to eompute the distances m a graph, and these can easily be adapted for the caleulation of the Wiener indcx. An algorithm that calculates the Wiener index of a tree in linear timc is givcn. It improves an algorithm of Canfield, Robinson and Rouvray. The question rcmains: is there an algorithm for general graphs that would eMculate the Wiener index without calculating the distance matrix? Another algorithm that calculates this index for an arbitrary graph is given.

View PDFchevron_right
A New Approach to Compute Wiener Index
Paul Manuel, Indra Rajasingh

Journal of Computational and Theoretical Nanoscience, 2013

Distance properties of molecular graphs form an important topic in chemical graph theory. The Wiener index of a graph G is defined as the sum of all distances between distinct vertices of G. A lot of research has been devoted to finding Wiener index by brute force method. In this paper we develop a method to compute the Wiener index of certain chemical graphs without using distance matrix.

View PDFchevron_right
Y-Wiener index of composite graphs
Samaneh Hossein-zadeh

2011

a b s t r a c t Eliasi and Taeri [Extension of the Wiener index and Wiener polynomial, Appl. Math. Lett. 21 (2008) 916-921] introduced the notion of y-Wiener index of graphs as a generalization of the classical Wiener index and hyper Wiener index of graphs. They obtained some mathematical properties of this new defined topological index. In this paper, the join, Cartesian product, composition, disjunction and symmetric difference of graphs under y-Wiener index are computed. By these results most parts of a paper by Sagan et al. [The Wiener polynomial of a graph, Int. J. Quant. Chem. 60 (1996) 959-969] and another paper by Khalifeh et al. [The hyper-Wiener index of graph operations, Comput. Math. Appl. 56 (2008) 1402-1407] are generalized.

View PDFchevron_right
Wiener Index of Total Graph of Some Graphs Research
shanu goyal

2017

Let G = (V,E) be a graph. The total graph T (G) of G is that graph whose vertex set is V ∪ E, and two vertices are adjacent if and only if they are adjacent or incident in G. For a graph G = (V,E), the graph G.Sm is obtained by identifying each vertex of G by a root vertex of Sm and the graph Sm.G is obtained by identifying each vertex of Sm except root vertex by any vertex of G, where Sm is a star graph with m vertices. In this paper, we consider G as the cycle graph Cn with n vertices and investigate the Wiener index of the total graphs of Cn.Sm and Sn.Cm. MSC: 05C12, 05C76

View PDFchevron_right
Optimizing Wiener and Randić Indices of Graphs
Anuradha Mahasinghe

2020

Wiener and Randic indices have long been studied in chemical graph theory as connection strength measures of graphs. Later, these indices were used in different fields such as network analysis. We consider two optimization problems related to these indices, with potential applications to network theory, in particular to epidemiological networks. Given a connected graph and a fixed total edge weight, we investigate how individual weights must be assigned to edges, minimizing the connection strength of the graph. In order to measure the connection strength, we use the weighted Wiener index and a modified version of the ordinary Randic index. Wiener index optimization is linear, while Randic index optimization turns out to be both nonlinear and nonconvex. Hence, we adopt the technique of separable programming to generate solutions. We present our experimental results by applying relevant algorithms to several graphs.

View PDFchevron_right
Wiener Index of Directed and Weighted Graphs by MATLAB Program
IOSR Journals

Abstract: The Wiener index is the one of the oldest and most commonlyused topological indices in the quantitative structure-property relationships. It is defined by the sum of the distances between all (ordered) pairs of vertices of G. In this paper, we use MATLAB program for finding the Wiener index of the vertex weighted, edge weighted directed and undirected graphs Keywords: Distance Sum, MATLAB, Sparse Matrix, Wiener Index

View PDFchevron_right
On the Wiener Index of Some Total Graphs
shanu goyal

2017

View PDFchevron_right
Peripheral Wiener Index of a Graph
Kishori Narayankar

2017

The eccentricity of a vertex $v$ is the maximum distance between $v$ and anyother vertex. A vertex with maximum eccentricity is called a peripheral vertex.The peripheral Wiener index $ PW(G)$ of a graph $G$ is defined as the sum ofthe distances between all pairs of peripheral vertices of $G.$ In this paper, weinitiate the study of the peripheral Wiener index and we investigate its basicproperties. In particular, we determine the peripheral Wiener index of thecartesian product of two graphs and trees.

View PDFchevron_right
On the Kirchhoff and the Wiener Indices of Graphs and Block Decomposition
Ashkan Nikseresht

2014

In this article we state a relation between the Kirchhoff and Wiener indices of a simple connected graph G and the Kirchhoff and Wiener indices of those sub-graphs of G which are induced by its blocks. Then as an application, we define a composition of a rooted tree T and a graph G and calculate its Kirchhoff index in terms of parameters of T and G. Finally, we present an algorithm for computing the resistance distances and the Kirchhoff index and a similar one for computing the weighted distances and the Wiener index of a graph. These algorithms are asymp-totically faster than the previously known algorithms, on graphs in which the order of the subgraphs induced by blocks is small with respect to the order of the graph.

View PDFchevron_right

References (23)

  1. Wiener, H. (1947) Structural determination of paraffin boiling points, Journal of the Amer- ican Chemical Society, 69(1), 17-20.
  2. Bogdanov, B., Nikolić, S. and Trinajstić, N. (1989) On the three-dimensional Wiener number, Journal of Mathematical Chemistry, 3, 299-309.
  3. Chepoi, V. and Klavžar, S. (1997) The Wiener index and the szeged index of benzenoid systems in linear time, Journal of Chemical Information and Computer Sciences , 37, 752- 755.
  4. Bajaj, S., Sambi, S.S. and Madan, A.K. (2006) Models for prediction of anti-neoplastic activity of 1,2-bis(sulfonyl)-1-methylhydrazines: Computational approach using Wiener's indices, MATCH Communications in Mathematical and in Computer Chemistry, 55, 193- 204.
  5. Dobrynin, A.A., Entringer, R. and Gutman, I. (2001) Wiener index of trees: Theory and applications, Acta Applicandae Mathematica, 66, 211-249.
  6. Dobrynin, A.A., Gutman, I., Klavžar, S. and Žigert, P. (2002) Wiener index of hexagonal systems, Acta Applicandae Mathematica, 72, 247-294.
  7. Gutman, I. and Polansky, O. (1986) Mathematical Concepts in Organic Chemistry, Springer- Verlag, Berlin Heidelberg, New York.
  8. Shiu, W.C. and Lam, P.C.B. (1997) The Wiener number of the hexagonal net, Discrete Applied Mathematics, 73, 101-111.
  9. Shiu, W.C., Lam, P.C.B. and Poon, K.K. (2002) On Wiener numbers of polygonal nets, Discrete Applied Mathematics, 122, 251-261.
  10. Mihalić, Z., Veljan, D., Amić, D., Nikolić, S., Plavšić, D. and Trinajstić, N. (1992) The distance matrix in chemistry, Journal of Mathematical Chemistry, 11, 223-258.
  11. Chung, F.R.K., Coffman, E.G., Reiman, M.I. and Simon, B. (1987) The forwarding index of communication networks, IEEE Transactions on Information theory, 33, 224-232.
  12. Xu, M. and Xu, J.M. (2007) The forwarding indices of augmented cubes, Information Pro- cessing Letters, 101, 185-189.
  13. Entringer, R.C., Jackson, D.E. and Snyder, D.A. (1976) Distance in graphs, Czechoslovak Mathematical Journal 26, 283-296.
  14. Buckley, F. and Harary, F. (1990) Distance in Graphs, Perseus Books, Addison-Wesley, Redwood, UK.
  15. Plesnik, J. (1984) On the sum of all distances in a graph or digraph, Journal of Graph Theory, 8, 1-21.
  16. Dankelmann, P. (1994) Average distance and independence numbers, Discrete Applied Math- ematics, 51, 75-83.
  17. Alizadeh, Y., Andova, V., Klavžar, S. and Škrekovski, R. (2014) Wiener dimension: Fun- damental properties and (5,0)-Nanotubical fullerenes, MATCH Communications in Mathe- matical and in Computer Chemistry, 72, 279-294.
  18. Freeman, L.C. (1978-1979) Centrality in social networks conceptual clarification , Social Networks, 1, 215-239.
  19. Mohar, B. and Pisanski, T. (1988) How to compute the Wiener index of a graph, Journal of Mathematical Chemistry, 2, 267-277.
  20. Klavžar, S., Gutman, I. and Mohar, B. (1995) Labeling of benzenoid systems which reflects the vertex-distance relations, Journal of Chemical Information and Computer Sciences, 35, 590-593.
  21. Manuel, P., Rajasingh, I., Rajan, B. and Rajan, R.S. (2013) A New Approach to Compute Wiener Index, Journal of Computational and Theoretical Nanoscience, 10, 1515-1521.
  22. Imran, M., Hayat, S. and Mailk, M.Y.H. (2014) On topological indices of certain intercon- nection networks, Applied Mathematics and Computation, 244, 936-951.
  23. Manuel, P.D., Abd-El-Barr, M.I., Rajasingh, I. and Rajan, B. (2008) An efficient represen- tation of benes networks and its applications, Journal of Discrete Algorithms, 6, 11-19.

Related papers

The edge-Wiener index of a graph
Simon Mukwembi

Discrete Mathematics, 2009

If G is a connected graph, then the distance between two edges is, by definition, the distance between the corresponding vertices of the line graph of G. The edge-Wiener index W e of G is then equal to the sum of distances between all pairs of edges of G. We give bounds on W e in terms of order and size. In particular we prove the asymptotically sharp upper bound W e (G) ≤ 2 5 5 5 n 5 + O(n 9/2 ) for graphs of order n.

View PDFchevron_right
Wiener Index of Chain Graphs
Arathi bhat

A bipartite graph is called a chain graph if the neighborhoods of the vertices in each partite set form a chain with respect to set inclusion. Chain graphs are discovered and rediscovered by various researchers in various contexts. Also, they were named differently according to the applications in which they arise. In the field of Spectral Graph Theory, chain graphs play a remarkable role. They are characterized as graphs with the largest spectral radius among all the connected bipartite graphs with prescribed number of edges and vertices. Even though chain graphs are significant in the field of Spectral Graph Theory, the area of graph parameters remains untouched. Wiener index is one of the oldest and most studied topological indices, both from theoretical point of view and applications. The Wiener index of a graph is defined as the sum of distances between every pair of vertices in it. In this article, we give bounds for Wiener index and hence for average distance of chain graphs. We also present a quadratic time algorithm that returns a realising chain graph G (if exists) whose Wiener index is the given integer w. The algorithm presented in this article contributes to the existing knowledge in the theory of inverse Wiener index problem. We conclude this article by exploring some more graph parameters called edge Wiener index, hyper Wiener index and Zagreb indices of chain graphs.

View PDFchevron_right
Peripheral Wiener Index of Graph Operations
Afework Kahsay

2019

Peripheral Wiener index of a graph is the sum of the distance of the peripheral vertices of a graph. In this paper the peripheral Wiener index of graph operations is investigated.

View PDFchevron_right
Some results on Wiener index of a graph: an overview
Snježana Majstorović

Proceedings of the 2nd Croatian Combinatorial Days, 2019

The Wiener index W (G) of a connected graph G is defined as the sum of distances between all pairs of vertices in G. In 1991,Šoltés [9] posed the problem of finding all graphs G such that equality W (G) = W (G − v) holds for all vertices v in G. The only known graph with this property is the cycle C 11. Our main object of study is the relaxed version of this problem: find graphs for which Wiener index does not change when a particular vertex v is removed. This overview contains results which were obtained and published during the past two years concerning relaxedŠoltés's problem.

View PDFchevron_right
Wiener index of composite graphs
Alireza Ashrafi

2011

a b s t r a c t Eliasi and Taeri [Extension of the Wiener index and Wiener polynomial, Appl. Math. Lett. 21 (2008) 916-921] introduced the notion of y-Wiener index of graphs as a generalization of the classical Wiener index and hyper Wiener index of graphs. They obtained some mathematical properties of this new defined topological index. In this paper, the join, Cartesian product, composition, disjunction and symmetric difference of graphs under y-Wiener index are computed. By these results most parts of a paper by Sagan et al. [The Wiener polynomial of a graph, Int. J. Quant. Chem. 60 (1996) 959-969] and another paper by Khalifeh et al. [The hyper-Wiener index of graph operations, Comput. Math. Appl. 56 (2008) 1402-1407] are generalized.

View PDFchevron_right

Related topics

  • Algorithms
    • 580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved