Vertex and link residual closeness of graphs of given fractional matching number
From MaRDI portal
Publication:6629662
DOI10.1142/s0129054123500193MaRDI QIDQ6629662
Publication date: 30 October 2024
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Cites Work
- Title not available (Why is that?)
- On maximal energy of line graphs with given parameters
- 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
- Link Vulnerability in Networks
- Residual Closeness of Generalized Thorn Graphs
- Networks with Extremal Closeness
- A Note on the Link Residual Closeness of Graphs Under Join Operation
- Extremal Results on Vertex and Link Residual Closeness
- Residual closeness of graphs with given parameters
This page was built for publication: Vertex and link residual closeness of graphs of given fractional matching number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6629662)
