Extremal <i>k</i>-Connected Graphs with Maximum Closeness
Closeness is a measure that quantifies how quickly information can spread from a given node to all other nodes in the network, reflecting the efficiency of communication within the network by indicating how close a node is to all other nodes. For a graph <i>G</i>, the subset <i>S&l...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2024-11-01
|
| Series: | Axioms |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2075-1680/13/12/810 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|