A vulnerability parameter of networks
From MaRDI portal
Publication:2037692
DOI10.1134/S0001434621030202zbMath1467.05249OpenAlexW3177575189MaRDI QIDQ2037692
Publication date: 8 July 2021
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0001434621030202
Cartesian productdominationlexicographic productnetwork design and communicationexponential dominationgraph vulnerabilityporous exponential domination
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Communication theory (94A05) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On exponential domination of \(C_m\times C_n\)
- Bounds on the exponential domination number
- On the group of the composition of two graphs
- Domination with exponential decay
- A survey of integrity
- Hereditary equality of domination and exponential domination
- Relating domination, exponential domination, and porous exponential domination
- Porous exponential domination in Harary graphs
- Tough graphs and Hamiltonian circuits.
- On Maximal Circuits in Finite Graphs
- Graphs with given connectivity properties
- Porous exponential domination number of some graphs
This page was built for publication: A vulnerability parameter of networks