scientific article; zbMATH DE number 5778835

MaRDI QIDQ3582610zbMATH OpenFDO

Authors Belgin Vatansever, Aysun Aytaç

Publication date 2 September 2010

zbMATH Keywords

stabilityvulnerabilityaverage lower total independence number

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Communication theory (94A05) Communication networks in operations research (90B18) Applications of graph theory to circuits and networks (94C15)

Recommendations

• The average lower independence number of total graphs
• On the average lower independence number of some graphs
• On average lower independence and domination numbers in graphs
• A lower bound on the independence number of a graph
• On the sum of independence number and average degree of a graph
• scientific article; zbMATH DE number 2197886
• A lower bound on the independence number of a graph in terms of degrees
• Average lower domination number of graphs
• On the average lower bondage number of a graph
• The average lower domination number of graphs

Cited in

(4)

• On the average lower independence number of some graphs
• On average lower independence and domination numbers in graphs
• On computing the vulnerability of some graphs as average
• The average lower independence number of total graphs

This page was built for publication:

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