Pages that link to "Item:Q3637410"
From MaRDI portal
The following pages link to Centers in Connected Undirected Graphs: An Axiomatic Approach (Q3637410):
Displaying 18 items.
- Stable network topologies using the notion of covering (Q439583) (← links)
- Identifying stable network structures and sets of key players using a \(W\)-covering perspective (Q459386) (← links)
- Centrality measure in graphs (Q977050) (← links)
- Finding a central vertex in an HHD-free graph (Q1408816) (← links)
- Measuring centrality by a generalization of degree (Q1642790) (← links)
- Axiomatic characterization of the center function. The case of non-universal axioms (Q1752587) (← links)
- Characterizations of the 3-cycle count and backward length of a tournament (Q1767699) (← links)
- On centers of soluble graphs (Q2145047) (← links)
- A Fiedler center for graphs generalizing the characteristic set (Q2332427) (← links)
- Axiomatic characterization of the center function. the case of universal axioms (Q2357132) (← links)
- Stable and emergent network topologies: a structural approach (Q2370364) (← links)
- Structural stability of coalitions: a formal model highlighting the role of participants positioned between members and neutral actors (Q2669177) (← links)
- Networks, Information and Choice (Q2787407) (← links)
- On the Center Sets of Some Graph Classes (Q2795951) (← links)
- Approximating the Restricted 1-Center in Graphs (Q3467877) (← links)
- (Q4838485) (← links)
- A survey of sequences of central subgraphs (Q4934866) (← links)
- Centrality in organizational networks (Q5190039) (← links)
