Extremal Results on Vertex and Link Residual Closeness
From MaRDI portal
Publication:6114849
DOI10.1142/s0129054121500295zbMath1522.68434OpenAlexW3198292605MaRDI QIDQ6114849
Haiyan Guo, Zhenan Li, Bo Zhou
Publication date: 15 August 2023
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054121500295
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10)
Related Items (4)
Link Residual Closeness of Harary Graphs ⋮ Residual closeness of graphs with given parameters ⋮ On the residual closeness of graphs with cut vertices ⋮ Additional Closeness of Cycle Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- DVcube: a novel compound architecture of disc-ring graph and hypercube-like graph
- Two spanning disjoint paths with required length in generalized hypercubes
- Fault tolerance in bubble-sort graph networks
- Properties of a hierarchical network based on the star graph
- Hamiltonicity of the hierarchical cubic network
- Residual Closeness in Cycles and Related Networks
- RESIDUAL CLOSENESS OF WHEELS AND RELATED NETWORKS
- RESIDUAL CLOSENESS AND GENERALIZED CLOSENESS
- Reliability Hosoya-Wiener Polynomial of Double Weighted Trees*
- Network robustness and residual closeness
- Robustness of Regular Caterpillars
- Link Vulnerability in Networks
- Residual Closeness of Generalized Thorn Graphs
- Networks with Extremal Closeness
- Inequalities between distance-based graph polynomials
- A Note on the Link Residual Closeness of Graphs Under Join Operation
This page was built for publication: Extremal Results on Vertex and Link Residual Closeness