Scattering number and Cartesian product of graphs

MaRDI QIDQ5233396zbMATH OpenFDO

Authors Burak Kaval, Alpay Kirlangic

Publication date 10 September 2019

zbMATH Keywords

Cartesian productconnectivitygraph vulnerabilityscattering number

Mathematics Subject Classification ID

Connectivity (05C40) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Scattering number in graphs
• Scattering number of the product of some special classes of graphs
• A measure of graph vulnerability: Scattering number
• Computing the Scattering Number of Graphs
• A measure of graphs vulnerability: edge scattering number

Cited in

(14)

• The scattering number of strictly chordal graphs: linear time determination
• A combinatorial approach to scattering diagrams
• Scattering number in graphs
• A measure of graphs vulnerability: edge scattering number
• scientific article; zbMATH DE number 5925154 (Why is no real title available?)
• The scattering number and integrity of the complete k-ary trees
• Vertex-neighbor-scattering number of bipartite graphs
• Scattering number of the product of some special classes of graphs
• Computing the Scattering Number of Graphs
• Relationships between scattering number and other vulnerability parameters
• General p-neighbor scattering number of graphs
• Isolated scattering number of split graphs and graph products
• Scattering number of digraphs
• Vertex vulnerability in wrapped butterfly network

This page was built for publication: Scattering number and Cartesian product of graphs

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