scientific article; zbMATH DE number 6761041

From MaRDI portal

Revision as of 09:19, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4977393

Jump to:navigation, search

zbMath1370.05116MaRDI QIDQ4977393

Vecdi Aytac, Tufan Turaci

Publication date: 16 August 2017

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

connectivity domination number bondage number graph vulnerability exponential domination number exponential bondage number

Mathematics Subject Classification ID

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)

Related Items (4)

Exponential Independence Number of Some Graphs ⋮ Exponential Domination Critical and Stability in Some Graphs ⋮ A vulnerability parameter of networks ⋮ Efficient Identification of Node Importance Based on Agglomeration in Cycle-Related Networks

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4977393&oldid=19418142"