A New Vertex Connectivity Metric
Data Structures and Algorithms
2021-05-24 v2 Discrete Mathematics
Abstract
A new metric for quantifying pairwise vertex connectivity in graphs is defined and an implementation presented. While general in nature, it features a combination of input features well-suited for social networks, including applicability to directed or undirected graphs, weighted edges, and computes using the impact from all-paths between the vertices. Moreover, the method is applicable to large graphs. Comparisons with other techniques are included.
Cite
@article{arxiv.2105.07968,
title = {A New Vertex Connectivity Metric},
author = {David L. Rhodes and Breanna N. Johnson},
journal= {arXiv preprint arXiv:2105.07968},
year = {2021}
}
Comments
9 pages, 3 figures, 4 tables