Computing closeness for some graphs

DOI10.2478/AUSI-2023-0015OpenAlexW4389617128MaRDI QIDQ6152844FDOQ6152844

Aysun Aytaç, Hande Tunçel Gölpek

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

zbMATH Keywords

Mycielski graphclosenessgraph vulnerabilitytadpole graph

Mathematics Subject Classification ID

Computer science (68-XX)

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
• Title not available (Why is that?)
• 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)