Centers in Connected Undirected Graphs: An Axiomatic Approach
From MaRDI portal
Publication:3637410
DOI10.1287/opre.1030.0082zbMath1165.05341MaRDI QIDQ3637410
Publication date: 10 July 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.1030.0082
91D30: Social networks; opinion dynamics
90B10: Deterministic network models in operations research
05C75: Structural characterization of families of graphs
Related Items
Centrality in organizational networks, Stable network topologies using the notion of covering, Identifying stable network structures and sets of key players using a \(W\)-covering perspective, Centrality measure in graphs, Measuring centrality by a generalization of degree, Axiomatic characterization of the center function. The case of non-universal axioms, Characterizations of the 3-cycle count and backward length of a tournament, Stable and emergent network topologies: a structural approach, Networks, Information and Choice