The centrality index of a graph
From MaRDI portal
Publication:2525819
DOI10.1007/BF02289527zbMath0152.22703OpenAlexW1967570846WikidataQ53028250 ScholiaQ53028250MaRDI QIDQ2525819
Publication date: 1966
Published in: Psychometrika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02289527
Related Items
Medians in median graphs and their cube complexes in linear time ⋮ Identifying influential spreaders in complex networks by considering the impact of the number of shortest paths ⋮ PageRank centrality for temporal networks ⋮ A modified weighted TOPSIS to identify influential nodes in complex networks ⋮ Identifying influential spreaders in complex networks based on gravity formula ⋮ Identification of influential nodes in complex networks: method from spreading probability viewpoint ⋮ Ranking in evolving complex networks ⋮ Coordinated influence on the opinions of social network members ⋮ Reachability for airline networks: fast algorithm for shortest path problem with time windows ⋮ Generalized network measures based on modulus of families of walks ⋮ Structure-oriented prediction in complex networks ⋮ Identifying influential spreaders in complex networks based on improved k-shell method ⋮ A Laplacian approach to stubborn agents and their role in opinion formation on influence networks ⋮ A QSPR-like model for multilocus genotype networks of \textit{Fasciola hepatica} in Northwest Spain ⋮ Proximity, remoteness and distance eigenvalues of a graph ⋮ Measuring centrality by a generalization of degree ⋮ Diffusion centrality: a paradigm to maximize spread in social networks ⋮ Discount pricing in word-of-mouth marketing: an optimal control approach ⋮ Compressive sensing of high betweenness centrality nodes in networks ⋮ Exploring the heterogeneity for node importance byvon Neumann entropy ⋮ Distance in graphs ⋮ Algorithm for determining the mutual impact of nodes in weighted directed graphs ⋮ Consensus reaching process in large-scale group decision making based on bounded confidence and social network ⋮ On bounds for the cutting number of a graph ⋮ The bi-directional h-index and B-core decomposition in directed networks ⋮ A new method for centrality measurement using generalized fuzzy graphs ⋮ Bipolar-valued fuzzy social network and centrality measures ⋮ Identifying influential nodes in social networks: a voting approach ⋮ Identifying multiple influential spreaders by a heuristic clustering algorithm ⋮ A Faster Algorithm to Update Betweenness Centrality after Node Alteration ⋮ Centrality in time-delay consensus networks with structured uncertainties ⋮ A centrality measure for communication ability in weighted network ⋮ A maximum \(b\)-matching problem arising from median location models with applications to the roommates problem ⋮ Graph-theoretical derivation of brain structural connectivity ⋮ A novel method of evaluating key nodes in complex networks ⋮ Graph-based point drift: graph centrality on the registration of point-sets ⋮ The degree measure as utility function over positions in graphs and digraphs ⋮ A graph-theoretical basis of stochastic-cascading network influence: characterizations of influence-based centrality ⋮ Centrality measures in simplicial complexes: applications of topological data analysis to network science ⋮ Criteria for stochastic pinning control of networks of chaotic maps ⋮ Scalable computational techniques for centrality metrics on temporally detailed social network ⋮ Re-conceptualizing centrality in social networks ⋮ Formal style of Medersas buildings in North Africa ⋮ A Comprehensive Reachability Evaluation for Airline Networks with Multi-constraints ⋮ Influential nodes ranking in complex networks: an entropy-based approach ⋮ Centrality and power in social networks: A game theoretic approach. ⋮ Some results on approximate 1-median selection in metric spaces ⋮ Robustness analysis of urban road networks from topological and operational perspectives ⋮ A general higher-order supracentrality framework based on motifs of temporal networks and multiplex networks ⋮ Evidential identification of influential nodes in network of networks ⋮ Network Essence: PageRank Completion and Centrality-Conforming Markov Chains ⋮ Core-periphery structure in networks: a statistical exposition ⋮ Positional Dominance: Concepts and Algorithms ⋮ Modeling dependent gene expression ⋮ Graph Centrality Based Prediction of Cancer Genes ⋮ Co-ranking for nodes, layers and timestamps in multilayer temporal networks ⋮ Centrality in networks of urban streets ⋮ High-order degree and combined degree in complex networks ⋮ Optimally connected hybrid complex networks with windmill graphs backbone ⋮ Anisotropic Radial Layout for Visualizing Centrality and Structure in Graphs ⋮ InfoSearch: A Social Search Engine ⋮ Identifying the node spreading influence with largest \(k\)-core values ⋮ Snapshot centrality indices in dynamic FIFO networks ⋮ Spreading dynamics in complex networks ⋮ Forman curvature for complex networks ⋮ Core influence mechanism on vertex-cover problem through leaf-removal-core breaking ⋮ Which numbers are status differences? ⋮ Combinatorial network abstraction by trees and distances ⋮ Unnamed Item ⋮ Distance spectra of graphs: a survey ⋮ Robustness on topology reconfiguration of complex networks: an entropic approach ⋮ Tackling information asymmetry in networks: a new entropy-based ranking index ⋮ A new measure of identifying influential nodes: efficiency centrality ⋮ A faster algorithm for betweenness centrality* ⋮ Centrality measure in graphs ⋮ SOME CENTRALITY RESULTS NEW AND OLD ⋮ Energy disruptive centrality with an application to criminal network ⋮ Identifying and ranking influential spreaders in complex networks by neighborhood coreness ⋮ Ranking the spreading ability of nodes in complex networks based on local structure ⋮ Identifying influential spreaders by weighted leaderrank ⋮ Proximity, remoteness and girth in graphs ⋮ A new ranking algorithm and an evolutionary model based on comprehensive weighted clique degree for complex network ⋮ PageRank Beyond the Web ⋮ The effect of attacks on the railway network of Hungary ⋮ Criteria for ranking (poly)cyclic chemical constitutional graphs and their vertices via centrality measures ⋮ Brand diagnostics: Mapping branding effects using consumer associative networks ⋮ Measuring the flow of information among cities using the diffusion power ⋮ Axioms for Centrality ⋮ A Faster Algorithm to Update Betweenness Centrality After Node Alteration ⋮ TOPOLOGICAL PROPERTIES OF BANK NETWORKS: THE CASE OF BRAZIL ⋮ Structural sparsity of complex networks: bounded expansion in random models and real-world graphs ⋮ Graph-theoretical analysis of the Swiss road and railway networks over time ⋮ Attachment centrality: measure for connectivity in networks ⋮ Identifying vital nodes in complex networks based on information entropy, minimum dominating set and distance ⋮ Spectral rank monotonicity on undirected networks ⋮ Optimal centrality computations within bounded clique-width graphs ⋮ The Dynamics of Closeness and Betweenness ⋮ An integer programming approach for finding the most and the least central cliques ⋮ Identification of node centrality based on Laplacian energy of networks ⋮ An efficient noisy binary search in graphs via Median approximation ⋮ Central Positions in Social Networks ⋮ A novel centrality measure for identifying influential nodes based on minimum weighted degree decomposition ⋮ Unnamed Item ⋮ Early-time measure in eternal inflation ⋮ Rank the spreading influence of nodes using dynamic Markov process ⋮ Average Sensitivity of Graph Algorithms ⋮ Centrality measures in networks ⋮ Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter ⋮ Paths and flows for centrality measures in networks ⋮ Novel centrality metrics for studying essentiality in protein‐protein interaction networks based on group structures ⋮ Leverage centrality analysis of infrastructure networks ⋮ Graphs with \(G^p\)-connected medians ⋮ Conflict-tolerant and conflict-free multi-agent meeting ⋮ Global and local structure‐based influential nodes identification in wheel‐type networks ⋮ Axiomatic characterization of PageRank ⋮ Hardness of bounding influence via graph modification ⋮ NETWORK ANALYSIS OF VERBAL COMMUNICATIONS IN THE NOVEL THE MASTER AND MARGARITA BY M. A. BULGAKOV ⋮ Unnamed Item ⋮ Human centered processes and decision support systems ⋮ A new metric to quantify influence of nodes in social networks ⋮ CENTRALITY ESTIMATION IN LARGE NETWORKS ⋮ CENTRALITY ESTIMATION IN LARGE NETWORKS ⋮ Synchronizability of double-layer dumbbell networks ⋮ Three Hypergraph Eigenvector Centralities ⋮ The self-organized critical multiverse ⋮ Relating centralities in graphs and the principal eigenvector of its distance matrix ⋮ Accessibility measure for eternal inflation: dynamical criticality and higgs metastability
Cites Work
