Neighbor Rupture Degree of Harary Graphs

DOI10.1142/S012905411650026XzbMath1355.68200OpenAlexW2551125584MaRDI QIDQ5298312

Goksen Bacak-Turan, Ferhan Nihan Altundag

Publication date: 14 December 2016

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s012905411650026x

zbMATH Keywords

vulnerabilityHarary graphsneighbor rupture degree

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)

Cites Work

• Graph operations and neighbor rupture degree
• Neighbour-connectivity in regular graphs
• On a class of posets and the corresponding comparability graphs
• Rupture degree of graphs
• THE MAXIMUM CONNECTIVITY OF A GRAPH

This page was built for publication: Neighbor Rupture Degree of Harary Graphs