A New Vertex Connectivity Metric

05/17/2021
by   David L. Rhodes, et al.
0

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 O(V+E) method is applicable to large graphs. Comparisons with other techniques are included.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/08/2022

Directed Steiner path packing and directed path connectivity

For a digraph D=(V(D), A(D)), and a set S⊆ V(D) with r∈ S and |S|≥ 2, a ...
research
03/31/2021

Vertex Connectivity in Poly-logarithmic Max-flows

The vertex connectivity of an m-edge n-vertex undirected graph is the sm...
research
09/04/2017

Anisotropic Radial Layout for Visualizing Centrality and Structure in Graphs

This paper presents a novel method for layout of undirected graphs, wher...
research
01/13/2021

Assortativity measures for weighted and directed networks

Assortativity measures the tendency of a vertex in a network being conne...
research
09/11/2023

DynamicScore: a Novel Metric for Quantifying Graph Dynamics

This study introduces a new metric called ”DynamicScore” to evaluate the...
research
08/02/2020

On Frink's type metrization of weighted graphs

Using the technique of the metrization theorem of uniformities with coun...
research
12/19/2017

Generalizations of Edge Overlap to Weighted and Directed Networks

With the increasing availability of behavioral data from diverse digital...

Please sign up or login with your details

Forgot password? Click here to reset