Residual closeness of graphs with given parameters

DOI10.1007/S40305-022-00405-9OpenAlexW4224216748MaRDI QIDQ6151007FDOQ6151007

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

connectivitybipartitenessedge connectivityresidual closeness

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• On the residual closeness of graphs with cut vertices
• Vertex and link residual closeness of graphs of given fractional matching number
• Link Residual Closeness of Harary Graphs

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)