Residual closeness of graphs with given parameters

DOI10.1007/s40305-022-00405-9MaRDI QIDQ6151007

Bo Zhou, Meiqun Cheng

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

connectivity; bipartiteness; edge connectivity; residual closeness

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C12: Distance in graphs

68M15: Reliability, testing and fault tolerance of networks and computer systems

Related Items

Link Residual Closeness of Harary Graphs, On the residual closeness of graphs with cut vertices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bipartiteness and the least eigenvalue of signless Laplacian of graphs
• Extremal properties of the bipartite vertex frustration of graphs
• The node-deletion problem for hereditary properties is NP-complete
• On a class of posets and the corresponding comparability graphs
• Tough graphs and Hamiltonian circuits.
• Residual Closeness in Cycles and Related Networks
• RESIDUAL CLOSENESS OF WHEELS AND RELATED NETWORKS
• RESIDUAL CLOSENESS AND GENERALIZED CLOSENESS
• Multiscale vulnerability of complex networks
• Network robustness and residual closeness
• Robustness of Regular Caterpillars
• Residual Closeness of Generalized Thorn Graphs
• Networks with Extremal Closeness
• The binding number of a graph and its Anderson number
• Extremal Results on Vertex and Link Residual Closeness