Computing closeness for some graphs

DOI10.2478/AUSI-2023-0015MaRDI QIDQ6152844zbMATH OpenOpenAlexFDO

Authors Hande Tunçel Gölpek, Aysun Aytaç

Publication date 13 February 2024

Published in Acta Universitatis Sapientiae. Informatica (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

• scientific article; zbMATH DE number 2131198 (Why is no real title available?)
• scientific article; zbMATH DE number 3885963 (Why is no real title available?)
• scientific article; zbMATH DE number 3717369 (Why is no real title available?)
• scientific article; zbMATH DE number 194437 (Why is no real title available?)
• scientific article; zbMATH DE number 6770087 (Why is no real title available?)
• Closeness centrality in some splitting networks
• Closeness of splitting graphs
• Collective dynamics of `small-world' networks
• Exploring complex networks
• Graph theory for big data analytics
• Residual closeness and generalized closeness
• Residual closeness in cycles and related networks
• Residual closeness of wheels and related networks
• Sur le coloriage des graphs
• Vulnerability of Mycielski graphs via residual closeness.

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)