Residual closeness of graphs with given parameters

DOI10.1007/S40305-022-00405-9MaRDI QIDQ6151007zbMATH OpenOpenAlexFDO

Authors Meiqun Cheng, Bo Zhou

Publication date 9 February 2024

Published in Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s40305-022-00405-9

zbMATH Keywords

bipartitenessconnectivityedge connectivityresidual closeness

Mathematics Subject Classification ID

Distance in graphs (05C12) Extremal problems in graph theory (05C35) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• Extremal Results on Vertex and Link Residual Closeness
• On the residual closeness of graphs with cut vertices
• Robustness of regular caterpillars
• Network robustness and residual closeness
• Residual closeness in cycles and related networks

Cites work

• Bipartiteness and the least eigenvalue of signless Laplacian of graphs
• Extremal properties of the bipartite vertex frustration of graphs
• Extremal Results on Vertex and Link Residual Closeness
• Graph theory
• scientific article; zbMATH DE number 194437 (Why is no real title available?)
• Multiscale vulnerability of complex networks
• Network robustness and residual closeness
• Networks with extremal closeness
• On a class of posets and the corresponding comparability graphs
• Residual closeness and generalized closeness
• Residual closeness for helm and sunflower graphs
• Residual closeness in cycles and related networks
• Residual closeness of generalized thorn graphs
• Residual closeness of wheels and related networks
• Robustness of regular caterpillars
• Social and economic networks.
• The binding number of a graph and its Anderson number
• The node-deletion problem for hereditary properties is NP-complete
• Tough graphs and Hamiltonian circuits.

Cited in

(5)

• Link Residual Closeness of Harary Graphs
• On the residual closeness of graphs with cut vertices
• Vertex and link residual closeness of graphs of given fractional matching number
• Closeness spectra and structural uniqueness of special graph classes
• On graphs with second largest closeness eigenvalue at most zero

This page was built for publication: Residual closeness of graphs with given parameters

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