Neighbor rupture degree and the relations between other parameters.
From MaRDI portal
Publication:4649992
zbMATH Open1265.05328MaRDI QIDQ4649992FDOQ4649992
Authors: Goksen Bacak-Turan, Alpay Kirlangic
Publication date: 15 November 2012
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Network design and communication in computer systems (68M10)
Cited In (15)
- Neighbor rupture degree of total graphs and their complements
- Relationships between vertex attack tolerance and other vulnerability parameters
- Neighbor rupture degree of transformation graphs \(G^{xy-}\)
- The rupture degree and gear graphs
- Isolated Rupture in Thorny Networks
- The weak rupture degree of graphs and the network invulnerability
- Solitude number at graphs
- The relationship between rupture degree and other vulnerability parameters
- A novel graph-operational matrix method for solving multidelay fractional differential equations with variable coefficients and a numerical comparative survey of fractional derivative types
- Title not available (Why is that?)
- Neighbor toughness of graphs
- A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs
- Graph operations and neighbor rupture degree
- Neighbor rupture degree of Harary graphs
- A fast numerical method for fractional partial integro-differential equations with spatial-time delays
This page was built for publication: Neighbor rupture degree and the relations between other parameters.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649992)