On the average lower independence number of some graphs

MaRDI QIDQ5377838zbMATH OpenFDO

Authors Vecdi Aytac

Publication date 27 May 2019

zbMATH Keywords

connectivityvulnerabilitynetwork design and communicationthorn graphslower average independence number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) 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 computing the vulnerability of some graphs as average
• scientific article; zbMATH DE number 5778835
• The average lower connectivity of graphs
• On average lower independence and domination numbers in graphs

Cited in

(9)

• On computing the vulnerability of some graphs as average
• The average size of independent sets of graphs
• scientific article; zbMATH DE number 5778835 (Why is no real title available?)
• Lower bound of the Hadwiger number of graphs by their average degree
• On average lower independence and domination numbers in graphs
• The average lower independence number of total graphs
• Average lower domination number of graphs
• Vertex vulnerability parameter of gear graphs
• The average lower connectivity of graphs

This page was built for publication: On the average lower independence number of some graphs

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