Residual closeness of graphs with given parameters
From MaRDI portal
Publication:6151007
DOI10.1007/S40305-022-00405-9OpenAlexW4224216748MaRDI QIDQ6151007FDOQ6151007
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
Recommendations
Extremal problems in graph theory (05C35) Distance in graphs (05C12) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Cites Work
- Graph theory
- Social and economic networks.
- The node-deletion problem for hereditary properties is NP-complete
- Title not available (Why is that?)
- 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 for helm and sunflower graphs
- Residual closeness of generalized thorn graphs
- Extremal Results on Vertex and Link Residual Closeness
Cited In (3)
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)
