Vertex-neighbor-scattering number of graphs.

MaRDI QIDQ4649999zbMATH OpenFDO

Authors Zongtian Wei, Anchan Mai, Meijuan Zhai

Publication date 15 November 2012

zbMATH Keywords

network vulnerabilityvertex-neighbor-scattering numbervertex-neighbor-connectivity

Mathematics Subject Classification ID

Connectivity (05C40)

Recommendations

• Scattering number in graphs
• A measure of graph vulnerability: Scattering number
• Edge-neighbor-scattering number of graphs
• The average scattering number of graphs
• Vertex-neighbor-scattering number of bipartite graphs

Cited in

(9)

• Edge-neighbor-scattering number of graphs
• A polynomial algorithm of edge-neighbor-scattering number of trees
• Scattering number in graphs
• General \(p\)-neighbor scattering number of graphs
• Computing the weighted neighbor isolated tenacity of interval graphs in polynomial time
• A measure of graphs vulnerability: edge scattering number
• A measure of graph vulnerability: Scattering number
• Vertex-neighbor-scattering number of bipartite graphs
• Neighbor Isolated Tenacity of Graphs

This page was built for publication: Vertex-neighbor-scattering number of graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649999)