Closeness centrality in some splitting networks

MaRDI QIDQ2209489zbMATH OpenFDO

Authors Vecdi Aytac, Tufan Turaci

Publication date 2 November 2020

Published in Computer Science Journal of Moldova (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International

Full work available at URL http://www.math.md/publications/csjm/issues/v26-n3/12741/

zbMATH Keywords

closeness centralitycomplex networksgraph theorynetwork design and communicationsplitting graphs

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 6770087
• Closeness of splitting graphs
• Vulnerability of some splitting graphs
• Network robustness and residual closeness
• Residual closeness and generalized closeness

Cited in

(14)

• Closeness of splitting graphs
• Additional closeness and networks growth
• Computing the closeness centralities of a type of the probabilistic neural networks
• The parameterized complexity of centrality improvement in networks
• Closeness centrality in neural and interconnection networks
• Networks with extremal closeness
• scientific article; zbMATH DE number 6770087 (Why is no real title available?)
• Disjoint multipath closeness centrality
• Link Residual Closeness of Harary Graphs
• Computing closeness for some graphs
• Computational complexity of network vulnerability analysis
• Additional Closeness of Cycle Graphs
• Closeness and vertex residual closeness of Harary graphs
• Determining vulnerability of central networks using closeness and Nordhaus-Gaddum type relation

This page was built for publication: Closeness centrality in some splitting networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2209489)