Vertex-neighbor-scattering number of bipartite graphs

DOI10.1142/S012905411650012XMaRDI QIDQ3186052zbMATH OpenOpenAlexFDO

Authors Zongtian Wei, Nannan Qi, Xiaokui Yue

Publication date 8 August 2016

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s012905411650012x

zbMATH Keywords

bipartite graphNP-completenessvertex-neighbor-scattering number

Mathematics Subject Classification ID

Connectivity (05C40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Vertex-neighbor-scattering number of trees
• Scattering number in graphs
• Scattering number and Cartesian product of graphs
• Vertex-neighbor-scattering number of graphs.
• A measure of graph vulnerability: Scattering number

Cites work

• Dominating sets for split and bipartite graphs
• Neighbour-connectivity in regular graphs

Cited in

(3)

• A polynomial algorithm of edge-neighbor-scattering number of trees
• Vertex-neighbor-scattering number of trees
• Vertex-neighbor-scattering number of graphs.

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

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