scientific article; zbMATH DE number 6395627
From MaRDI portal
Publication:5497164
zbMath1313.05202MaRDI QIDQ5497164
Publication date: 3 February 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
connectivitygraph algorithmsnetwork design and communicationgraph vulnerabilityaverage lower domination number
Analysis of algorithms and problem complexity (68Q25) 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) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)
Related Items (5)
The vulnerability of some networks including cycles via domination parameters ⋮ On the average lower bondage number of graphs under join and corona operations ⋮ The average lower reinforcement number of a graph ⋮ On the average lower bondage number of a graph ⋮ Exponential Independence Number of Some Graphs
This page was built for publication:
