Centers in Connected Undirected Graphs: An Axiomatic Approach
From MaRDI portal
Publication:3637410
DOI10.1287/opre.1030.0082zbMath1165.05341OpenAlexW2110305779MaRDI 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
Social networks; opinion dynamics (91D30) Deterministic network models in operations research (90B10) Structural characterization of families of graphs (05C75)
Related Items (10)
Stable and emergent network topologies: a structural approach ⋮ Measuring centrality by a generalization of degree ⋮ Structural stability of coalitions: a formal model highlighting the role of participants positioned between members and neutral actors ⋮ Stable network topologies using the notion of covering ⋮ Identifying stable network structures and sets of key players using a \(W\)-covering perspective ⋮ Axiomatic characterization of the center function. The case of non-universal axioms ⋮ Characterizations of the 3-cycle count and backward length of a tournament ⋮ Centrality measure in graphs ⋮ Centrality in organizational networks ⋮ Networks, Information and Choice
This page was built for publication: Centers in Connected Undirected Graphs: An Axiomatic Approach
