Additional Closeness of Cycle Graphs
From MaRDI portal
Publication:6169953
DOI10.1142/S0129054122500149zbMATH Open1522.90240OpenAlexW4282573444MaRDI QIDQ6169953FDOQ6169953
Authors: Chavdar Atanasov Dangalchev 
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/s0129054122500149
Recommendations
- Extending cycles in graphs
- scientific article; zbMATH DE number 7509361
- Cycle extendability in graphs and digraphs
- Cycle-connected graphs
- Cyclicity of graphs
- Publication:4726282
- Cycles in graphs and related problems
- scientific article; zbMATH DE number 6096657
- scientific article; zbMATH DE number 54781
- Residual closeness in cycles and related networks
Cites Work
- Residual closeness and generalized closeness
- Vulnerability of Mycielski graphs via residual closeness.
- Residual closeness in cycles and related networks
- Link vulnerability in networks
- Networks with extremal closeness
- Closeness centrality in some splitting networks
- 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
- Closeness of splitting graphs
- Additional closeness and networks growth
- Title not available (Why is that?)
- A note on the link residual closeness of graphs under join operation
- Extremal Results on Vertex and Link Residual Closeness
Cited In (4)
This page was built for publication: Additional Closeness of Cycle Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169953)
