Vulnerability Measures of Transformation Graph Gxy+

DOI10.1142/S0129054115500379zbMath1346.68023OpenAlexW2118225737MaRDI QIDQ3455748

Aysun Aytaç, Tufan Turaci

Publication date: 11 December 2015

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

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

zbMATH Keywords

communicationconnectivitynetwork designtransformation graphsgraph vulnerabilityweak domination numberstrong domination number

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)

Related Items (4)

Eccentric connectivity index in transformation graph \(G^{xy+}\) ⋮ On the average lower bondage number of graphs under join and corona operations ⋮ Analysis of Vulnerability of Some Transformation Networks ⋮ Exponential Independence Number of Some Graphs

Cites Work

• Strong weak domination and domination balance in a graph
• The transformation graph \(G^{xyz}\) when \(xyz=-++\)
• Transformation graph \(G^{-+-}\)
• Tough graphs and Hamiltonian circuits.

This page was built for publication: Vulnerability Measures of Transformation Graph G^xy+