The total distance (also known as the distance or transmission) of a graph G is the sum over all pairs of vertices u,v the distance d(u,v) between u and v. It ...
scholar.google.com › citations
For the parameters diameter, radius, average distance, connectivity and edge-connectivity, we compare the values of the parameter for G^@p and G. In particular, ...
Distance and connectivity measures in permutation graphs · W. Goddard, M. E. Raines, P. Slater · Published in Discrete Mathematics 1 September 2003 · Mathematics.
For the parameters diameter, radius, average distance, connectivity and edge-connectivity, we compare the values of the parameter for Gπ and G. In particular, ...
Goddarda, W., Rainesb, M.E. and Slaterc, P.J. (2003) Distance and Connectivity Measures in Permutation Graphs. Discrete Mathematics, 271, 61-70.
GODDARD W., E. Raines M., Slater P. Distance and connectivity measures in permutation graphs // Discrete Mathematics. 2003. Vol. 271. No. 1-3. pp. 61-70.
Jul 16, 2024 · In this paper, we consider constructing a distributed data structure capable of efficiently reporting the distance between two given vertices of ...
Missing: measures | Show results with:measures
A permutation graph Gπ of a graph G (or generalized prism) is obtained by taking two disjoint copies of G and adding an arbitrary matching between the ...
Oct 6, 2007 · A permutation graph is a simple graph associated with a permutation. Let c n be the number of connected permutation graphs on n vertices.
Apr 12, 2017 · I was wondering how to prove that an automorphism of an undirected graph induces a permutation of the set of the connected components of the graph.