-
On the Strong Metric Dimension of directed co-graphs
Let G be a strongly connected directed graph and u,v,w∈ V(G) be three ve...
11/25/2021 ∙ by Yannick Schmitz, et al. ∙
0
∙
share
read it
-
Vertex Connectivity in Poly-logarithmic Max-flows
The vertex connectivity of an m-edge n-vertex undirected graph is the sm...
03/31/2021 ∙ by Jason Li, et al. ∙
0
∙
share
read it
-
Assortativity measures for weighted and directed networks
Assortativity measures the tendency of a vertex in a network being conne...
01/13/2021 ∙ by Yelie Yuan, et al. ∙
0
∙
share
read it
-
Anisotropic Radial Layout for Visualizing Centrality and Structure in Graphs
This paper presents a novel method for layout of undirected graphs, wher...
09/04/2017 ∙ by Mukund Raj, et al. ∙
0
∙
share
read it
-
Strong Subgraph k-connectivity
Generalized connectivity introduced by Hager (1985) has been studied ext...
03/01/2018 ∙ by Yuefang Sun, et al. ∙
0
∙
share
read it
-
On Frink's type metrization of weighted graphs
Using the technique of the metrization theorem of uniformities with coun...
08/02/2020 ∙ by María Florencia Acosta, et al. ∙
0
∙
share
read it
-
Chickens and Dukes
Following on the King Chicken Theorems originally proved by Maurer, we e...
09/28/2021 ∙ by Carleton Imbens, et al. ∙
0
∙
share
read it
A New Vertex Connectivity Metric
05/17/2021 ∙ by David L. Rhodes, et al. ∙
0
∙
share
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
Comments
There are no comments yet.