Name
Abstract | ||
|---|---|---|
Let G be a connected graph and let mu(G) = DD(G) - W(G), where DD(G) and W(G) stand for the detour and Wiener numbers of G, respectively. Nadjafi-Arani et al. [Math. Comput. Model. 55 (2012), 1644-1648] classified connected graphs whose difference between Szeged and Wiener numbers are n, for n = 4, 5. In this paper, we continue their work to prove that for any positive integer n not equal 1, 2, 4, 6 there is a graph with mu(G) = n. |
Year | Venue | Field |
|---|---|---|
2014 | AUSTRALASIAN JOURNAL OF COMBINATORICS | Integer,Discrete mathematics,Graph,Combinatorics,Connectivity,Mathematics |
DocType | Volume | ISSN |
Journal | 59 | 2202-3518 |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Modjtaba Ghorbani | 1 | 8 | 8.93 |
| nasrin azimi | 2 | 0 | 0.34 |