The vulnerability of some networks including cycles via domination parameters

DOI10.1155/2016/4705493OpenAlexW2424506078WikidataQ59129517 ScholiaQ59129517MaRDI QIDQ1659210

Hüseyin Aksan, Tufan Turaci

Publication date: 15 August 2018

Published in: Journal of Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2016/4705493

zbMATH Keywords

domination numberundirected simple connected graphvulnerability value of a communication network

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the bondage number of middle graphs
• On average lower independence and domination numbers in graphs
• Domination alteration sets in graphs
• Vulnerability of complex networks
• The average connectivity of a graph
• The average lower connectivity of graphs
• Tough graphs and Hamiltonian circuits.
• Residual Closeness in Cycles and Related Networks
• 2-bondage in graphs
• On the average lower bondage number of a graph
• VERTEX VULNERABILITY PARAMETER OF GEAR GRAPHS
• Design of survivable communications networks under performance constraints

This page was built for publication: The vulnerability of some networks including cycles via domination parameters