Vulnerability of some splitting graphs

MaRDI QIDQ5279045zbMATH OpenFDO

Authors Vecdi Aytac, Sema Bodur

Publication date 19 July 2017

zbMATH Keywords

network robustness to malicious attacks

Mathematics Subject Classification ID

Connectivity (05C40) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Domination integrity of splitting and degree splitting graphs of some graphs
• Domination integrity of splitting graph of path and cycle
• Vulnerability parameters of split graphs
• scientific article; zbMATH DE number 1339493
• The vulnerability of some networks including cycles via domination parameters

Cited in

(9)

• Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness
• Closeness centrality in some splitting networks
• Edge vulnerability parameters of split graphs
• Vulnerability of nearest neighbor graphs
• Solitude number at graphs
• The minimum vulnerability problem on specific graph classes
• scientific article; zbMATH DE number 1933267 (Why is no real title available?)
• Integrity of total transformation graphs
• Vulnerability parameters of split graphs

This page was built for publication: Vulnerability of some splitting graphs

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