Graph states form an important class of multipartite entangled quantum states. We propose a
new approach for distributing graph states across a quantum network. We consider a …

Residual closeness is a novel graph-based network vulnerability parameter. In this model,
links are perfectly reliable and the nodes fail independently of each other. We characterize …

The status of a vertex v in a connected graph G is defined as the sum of the distances from v
to all other vertices in G. The minimum status of G is the minimum of status of all vertices of …

The status (or transmission) of a vertex in a connected graph is the sum of distances
between the vertex and all other vertices. The minimum status (or minimum transmission) of …

The first and second status connectivity indices of a connected graph G are defined as S 1
(G)=∑ uv∈ E (G)[σ G (u)+ σ G (v)] and S 2 (G)=∑ uv∈ E (G) σ G (u) σ G (v) respectively …

Given a graph, the status of a vertex is the sum of the distances between the vertex and all
other vertices. The minimum status of a graph is the minimum of statuses of all vertices of …

Given a connected graph G, the status s G (x) of a vertex x of G is the sum of the distances
from x to all other vertices in G, and the status difference of G is sd (G)= max x, y∈ V (G)(s G …

Let $ G $ be a finite, simple connected graph. The average distance of a vertex $ v $ of $ G $
is the arithmetic mean of the distances from $ v $ to all other vertices of $ G $. The …

For a vertex v of a connected graph G, the status of v is defined as the sum of the distances
from v to all other vertices in G. The minimum status of G is the minimum of status of all …

The resistance status of a vertex of a connected graph is the sum of the resistance distance
between this vertex and any other vertices of the graph. The minimum (maximum, resp.) …