Neighbor Rupture Degree of Transformation Graphs Gxy−

DOI10.1142/S0129054117500216zbMath1372.68198OpenAlexW2742812050MaRDI QIDQ5357506

Goksen Bacak-Turan, Ekrem Oz

Publication date: 8 September 2017

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

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

zbMATH Keywords

vulnerabilitytransformation graphsneighbor rupture degree

Mathematics Subject Classification ID

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

Related Items (1)

On agglomeration-based rupture degree in networks and a heuristic algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph operations and neighbor rupture degree
• Neighbour-connectivity in regular graphs
• The transformation graph \(G^{xyz}\) when \(xyz=-++\)
• Transformation graph \(G^{-+-}\)
• NEIGHBOR INTEGRITY OF TRANSFORMATION GRAPHS
• Neighbor Isolated Tenacity of Graphs
• On the Boolean function graph of a graph and on its complement

This page was built for publication: Neighbor Rupture Degree of Transformation Graphs Gxy−