Wiener index of the tensor product of cycles | [Journal of Prime Research in Mathematics • 2015]

Author(s):

1. K. PATTABIRAMAN: Department of Mathematics, Faculty of Engineering and Technology, Annamalai University, Annamalainagar 608 002, India.

Abstract:

The Wiener index, denoted by W (G), of a connected graph G is the sum of all pairwise distances of vertices of the graph, that is, W (G) = 21 u,v?PV (G) d(u, v). In this paper, we obtain the Wiener index of the tensor product of two cycles.

Page(s): 1-18

DOI: DOI not available

Published: Journal: Journal of Prime Research in Mathematics, Volume: 10, Issue: 1, Year: 2015

Keywords:

05C12 , Wiener index , , AMS SUBJECT , Tensor product , 05C76

References:

[1] Alon N. .2007 .Independent set in tensor graph powers. J. Graph Theory, 54 : 73-87.

[2] Assaf A. M. .1990 .. Ars Combin, 29 : 13-20.

[3] Balakrishnan R.,Ranganathan K. .2000 .. , : .

[4] Balakrishnan R.,Francis S.,Raj S. . .The Wiener index of Mycielskian of a graph and some product graphs (Preprint).. , : .

[5] Balakrishanan R.,Sridharan N.,Viswanathan Iyer K. .2008 .Wiener index of graphs with more than one cut vertex. Applied Mathematics Letters, 21 : 922-927.

[6] Balakrishanan R.,Sridharan N.,Viswanathan Iyer K. .2010 .A sharp lower bound for the Wiener index of a graph. Ars Combin, 97 : 249-255.

[7] Bresar B.,Imrich W.,Zmazek B. .2005 .Hypercubes as direct products. SIAM J. Discrete Math, 18 : 778-786.

[8] Du Z.,Zhou B. .2009 .Minimum Wiener indices of trees and unicyclic graphs of given matching number. MATCH Commun. Math. Comput. Chem, 63 : 101-112.

[9] Du Z.,Zhou B. .2009 .A note on Wiener indices of unicyclic graphs. Ars Combin, 93 : 97-103.

[10] Fischermann M.,Hoffmann A.,Rautenbach D. .2002 .Wiener index versus maximum degree in trees. Discrete Appl.Math, 122 : 127-137.

[11] Hu T.C. .1974 .Optimum communication spanning trees. SIAM J. Comput. 3, : 188-195.

[12] Imrich W. .2000 .. Product graphs: Structure and Recognition, : .

[13] Jelen F. .2003 .Superdominance order and distance of trees with bounded maximum degree. Discrete Appl.Math, 125 : 225-233.

[14] Klavˇzar S. .2003 .Wiener number of vertex-weighted graphs and a chemical application. Discrete Appl. Math, 125 : 225-233.

[15] Mamut A. .2008 .Vertex vulnerability parameters of kronecker products of complete graphs, Inform. , 106 : 258-262.

[16] Pattabiraman K.,Paulraja P. .2011 .Wiener index of tensor product of a path and a cycle. Discuss. Math. Graph Theory, 31 : 737-751.

[17] Paulraja P.,Varadarajan N. .2004 .Independent sets and matchings in tensor product of graphs. Ars Combinatoria, 72 : 263-276.

[18] Sagan B.E.,Yeh Y.N.,P. Zhang, Y.N. .1996 .The Wiener polynomial of a graph. Int. J. Quantum Chem, 60(5) : 45-49.

Citations

Downloads

Views