Computing closeness for some graphs
From MaRDI portal
Publication:6152844
DOI10.2478/AUSI-2023-0015OpenAlexW4389617128MaRDI QIDQ6152844FDOQ6152844
Authors: Hande Tunçel Gölpek, Aysun Aytaç 
Publication date: 13 February 2024
Published in: Acta Universitatis Sapientiae. Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/ausi-2023-0015
Cites Work
- Collective dynamics of `small-world' networks
- Exploring complex networks
- Sur le coloriage des graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Residual closeness and generalized closeness
- Vulnerability of Mycielski graphs via residual closeness.
- Residual closeness in cycles and related networks
- Title not available (Why is that?)
- Closeness centrality in some splitting networks
- Graph theory for big data analytics
- Residual closeness of wheels and related networks
- Closeness of splitting graphs
- Title not available (Why is that?)
This page was built for publication: Computing closeness for some graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6152844)
