#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2006

2018

- This year (1)
- Last 5 years (13)
- Last 10 years (20)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Sandi Klavzar, Mohammad J. Nadjafi-Arani
- Eur. J. Comb.
- 2014

It is proved that the Wiener index of a weighted graph (G,w) can be expressed as the sum of the Wiener indices of weighted quotient graphs with respect to an arbitrary combination of Θ∗-classes. Here… (More)

- Sandi Klavzar, Mohammad J. Nadjafi-Arani
- Eur. J. Comb.
- 2014

Let W (G) and Sz(G) be the Wiener index and the Szeged index of a connected graph G. It is proved that if G is a connected bipartite graph of order n ≥ 4, size m ≥ n, and if ` is the length of a… (More)

Average distance is an important parameter for measuring the communication cost of computer networks. A popular approach for its computation is to first partition the edge set of a network into… (More)

- Mohammad J. Nadjafi-Arani, H. Khodashenas, Ali Reza Ashrafi
- Mathematical and Computer Modelling
- 2012

- Mohammad J. Nadjafi-Arani, Gholam Hossein Fath-Tabar, Ali Reza Ashrafi
- Appl. Math. Lett.
- 2009

The vertex PI index of a graph G is the sum over all edges uv ∈ E(G) of the number of vertices which are not equidistant to u and v. In this paper, the extremal values of this new topological index… (More)

- Sandi Klavzar, Mohammad J. Nadjafi-Arani
- Discrete Applied Mathematics
- 2013

Let (G, w) be a network, that is, a graph G = (V (G), E(G)) together with the weight function w : E(G) → R. The Szeged index Sz(G, w) of the network (G, w) is introduced and proved that Sz(G, w) ≥ W… (More)

- Sandi Klavzar, Mohammad J. Nadjafi-Arani
- Discrete Mathematics
- 2014

A connected graph is said to be a cactus if each of its blocks is either a cycle or an edge. Let Cn be the set of all n-vertex cacti with circumference at least 4, and let Cn,k be the set of all… (More)

- Mohammad Khalily Dermany, Mostafa Shamsi, Mohammad J. Nadjafi-Arani
- Ad Hoc Networks
- 2017

The energy consumption is one of the most common issues in the Wireless Sensor Networks (WSNs). Since the communication usually accounts as a major power consumption, there is some techniques, such… (More)

If G is a graph and $$\mathcal{P}$$P is a partition of V(G), then the partition distance of G is the sum of the distance between all pairs of vertices that lie in the same part of $$\mathcal{P}$$P.… (More)