The average lower independence number of total graphs

MaRDI QIDQ2975669zbMATH OpenFDO

Authors Aysun Aytaç, Tufan Turaci

Publication date 11 April 2017

zbMATH Keywords

average lower independence numberconnectivitytotal graphvulnerability

Mathematics Subject Classification ID

Connectivity (05C40) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)

Recommendations

• On the average lower independence number of some graphs
• On computing the vulnerability of some graphs as average
• scientific article; zbMATH DE number 5778835
• The average lower connectivity of graphs
• Vertex vulnerability parameter of gear graphs

Cited in

(12)

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

This page was built for publication: The average lower independence number of total graphs

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