Volume 5, Issue 2 (9-2017)                   SCJ 2017, 5(2): 28-33 | Back to browse issues page

XML Persian Abstract Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Mahfooz E, Fath-Tabar G. Sum of distance between vertices of graphs. SCJ. 2017; 5 (2) :28-33
URL: http://scj.kashanu.ac.ir/article-1-300-en.html
1- - University of kashan
2- Assistant Professor University of kashan , fathtabar@kashanu.ac.ir
Abstract:   (480 Views)

Let G=(V,E) be a graph where v(G) and E(G) are vertices and edges of G, respectively. Sum of distance between vertices of graphs is called wiener invariant. In This paper, we present some proved results on the wiener invariant and some new result on the upper bound of wiener invariant of k-connected graphs.

Full-Text [PDF 991 kb]   (151 Downloads)    
Type of Study: Research | Subject: General
Received: 2015/12/19 | Accepted: 2016/08/5 | Published: 2017/10/29

Add your comments about this article : Your username or Email:
Write the security code in the box

Send email to the article author


© 2015 All Rights Reserved | Soft Computing Journal

Designed & Developed by : Yektaweb