Centers in Connected Undirected Graphs: An Axiomatic Approach
From MaRDI portal
Recommendations
- Axiomatic characterization of the center function. the case of universal axioms
- Axiomatic characterization of the center function. The case of non-universal axioms
- scientific article; zbMATH DE number 3867368
- A survey of sequences of central subgraphs
- Re-conceptualizing centrality in social networks
Cited in
(21)- Finding a central vertex in an HHD-free graph
- 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
- On centers of soluble graphs
- Centers of complex networks
- A Fiedler center for graphs generalizing the characteristic set
- Axiomatic characterization of the center function. the case of universal axioms
- Stable and emergent network topologies: a structural approach
- Structural stability of coalitions: a formal model highlighting the role of participants positioned between members and neutral actors
- Networks, information and choice
- On the Center Sets of Some Graph Classes
- Hyperpath centers
- scientific article; zbMATH DE number 3861213 (Why is no real title available?)
- Approximating the Restricted 1-Center in Graphs
- Stable network topologies using the notion of covering
- Identifying stable network structures and sets of key players using a \(W\)-covering perspective
- scientific article; zbMATH DE number 772778 (Why is no real title available?)
- A survey of sequences of central subgraphs
- Centrality in organizational networks
- Centrality measure in graphs
This page was built for publication: Centers in Connected Undirected Graphs: An Axiomatic Approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637410)
