scientific article; zbMATH DE number 3628999
From MaRDI portal
Publication:4190671
Cited in
(18)- The neighbour-scattering number can be computed in polynomial time for interval graphs
- Neighbour-connectivity in regular graphs
- Survival under random coverings of trees
- Optimal K-secure graphs
- The structure of neighbor disconnected vertex transitive graphs
- A polynomial algorithm of edge-neighbor-scattering number of trees
- Neighbor-connectivity of pancake networks and burnt pancake networks
- Neighbor connectivity of \(k\)-ary \(n\)-cubes
- A new bound for neighbor-connectivity of abelian Cayley graphs
- Optimizing network topology for cascade resilience
- A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs
- A novel graph-operational matrix method for solving multidelay fractional differential equations with variable coefficients and a numerical comparative survey of fractional derivative types
- Edge neighbor connectivity of Cartesian product graph \(G\times K_{2}\)
- Bounds for neighbor connectivity of Cayley graphs generated by trees and unicyclic graphs
- Neighbor-isolated scattering number of graphs
- The h-step limited star connectivity of hypercubes
- Neighbor connectivity of undirected toroidal meshes
- An upper bound for neighbor-connectivity of graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4190671)
