Vertex vulnerability parameter of gear graphs
From MaRDI portal
Publication:3173943
DOI10.1142/S0129054111008635zbMATH Open1226.68070OpenAlexW2059273818MaRDI QIDQ3173943FDOQ3173943
Authors: Aysun Aytaç, Tufan Turaci
Publication date: 10 October 2011
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054111008635
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Network design and communication in computer systems (68M10)
Cites Work
Cited In (10)
- On the average lower bondage number of a graph
- Efficient Identification of Node Importance Based on Agglomeration in Cycle-Related Networks
- On agglomeration-based rupture degree in networks and a heuristic algorithm
- Agglomeration-Based Node Importance Analysis in Wheel-Type Networks
- On the average lower bondage number of graphs under join and corona operations
- Laplacian and signless Laplacian spectra and energies of multi-step wheels
- The average lower reinforcement number of a graph
- The vulnerability of some networks including cycles via domination parameters
- Distance and eccentricity based polynomials and indices of m−level Wheel graph
- A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs
This page was built for publication: Vertex vulnerability parameter of gear graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3173943)