On computing the vulnerability of some graphs as average

MaRDI QIDQ3181817zbMATH OpenFDO

Authors Vecdi Aytac, Zeynep Nihan Odabaş

Publication date 12 October 2009

zbMATH Keywords

average lower independence numberconnectivitygraph theorymiddle graphvulnerability

Mathematics Subject Classification ID

Connectivity (05C40) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph theory (05C99) Graph theory (including graph drawing) in computer science (68R10) Communication networks in operations research (90B18) Combinatorial optimization (90C27)

Recommendations

• On the average lower independence number of some graphs
• The average lower independence number of total graphs
• scientific article; zbMATH DE number 5778835
• The average lower connectivity of graphs
• scientific article; zbMATH DE number 2197886

Cited in

(8)

• The average lower connectivity of graphs
• The average lower independence number of total graphs
• Vertex vulnerability parameter of gear graphs
• The minimum vulnerability problem on specific graph classes
• Average lower domination number for some middle graphs
• On the average lower independence number of some graphs
• Exponential independence number of some graphs
• scientific article; zbMATH DE number 2197886 (Why is no real title available?)

This page was built for publication: On computing the vulnerability of some graphs as average

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3181817)