The betweenness centrality of a vertex of a graph is the portion of the shortest paths between all pairs of vertices passing through a given vertex. We study upper bounds for this invariant and its relations to the diameter and average distance of a graph.
Contents
-
Open AccessNotes on the betweenness centrality of a graphDecember 31, 2011
-
December 31, 2011
-
December 31, 2011
-
December 31, 2011
-
December 31, 2011
-
Open AccessOn T points of algebroid functionsDecember 31, 2011
-
December 31, 2011
-
December 31, 2011
-
Open AccessOn approximation in Weighted Orlicz spacesDecember 31, 2011
-
December 31, 2011
-
Open Access$\bar \lambda $-statistically convergent double sequences in probabilistic normed spacesDecember 31, 2011
-
December 31, 2011
-
Open AccessConnectedness of the sets of weak efficient solutions for generalized vector equilibrium problemsDecember 31, 2011
-
Open AccessA note on representation of pseudovariant mapsDecember 31, 2011
-
December 31, 2011