Networks with extremal closeness

DOI10.3233/FI-2019-1815MaRDI QIDQ5229300zbMATH OpenFDO

Authors Darja Rupnik Poklukar, Janez Žerovnik

Publication date 14 August 2019

Published in Fundamenta Informaticae (Search for Journal in Brave)

zbMATH Keywords

extremal graphsgraph operationscloseness

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Additional Closeness of Cycle Graphs
• Closeness centrality in neural and interconnection networks
• Closeness centrality in some splitting networks
• Extremal Results on Vertex and Link Residual Closeness
• Relating centralities in graphs and the principal eigenvector of its distance matrix

Cited in

(14)

• Link Residual Closeness of Harary Graphs
• Residual closeness of graphs with given parameters
• Relating centralities in graphs and the principal eigenvector of its distance matrix
• scientific article; zbMATH DE number 6770087 (Why is no real title available?)
• Finding critical links for closeness centrality
• Closeness of splitting graphs
• Vertex and link residual closeness of graphs of given fractional matching number
• On networks with order close to the Moore bound
• The closeness eigenvalues of graphs
• Additional closeness and networks growth
• Closeness centrality in neural and interconnection networks
• Additional Closeness of Cycle Graphs
• Closeness centrality reconstruction of tree graphs
• Extremal Results on Vertex and Link Residual Closeness

This page was built for publication: Networks with extremal closeness

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