Vertex vulnerability parameter of gear graphs
From MaRDI portal
Publication:3173943
Recommendations
Cites work
Cited in
(11)- Agglomeration-Based Node Importance Analysis in Wheel-Type Networks
- The vulnerability of some networks including cycles via domination parameters
- On the average lower bondage number of graphs under join and corona operations
- The average lower reinforcement number of a graph
- Laplacian and signless Laplacian spectra and energies of multi-step wheels
- On the average lower bondage number of a graph
- 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
- The average lower independence number of total graphs
- Efficient identification of node importance based on agglomeration in cycle-related networks
- On agglomeration-based rupture degree in networks and a heuristic algorithm
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)