Average lower domination number of graphs

MaRDI QIDQ5497164zbMATH OpenFDO

Authors Vecdi Aytac

Publication date 3 February 2015

zbMATH Keywords

average lower domination numberconnectivitygraph algorithmsgraph vulnerabilitynetwork design and communication

Mathematics Subject Classification ID

Connectivity (05C40) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85) Network design and communication in computer systems (68M10) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Average lower domination number for some middle graphs
• Average edge-domination number in graphs
• On the average lower bondage number of a graph
• The average lower independence number of total graphs
• On the average lower independence number of some graphs

Cited in

(10)

• The vulnerability of some networks including cycles via domination parameters
• Average edge-domination number in graphs
• The average lower reinforcement number of a graph
• On the average lower bondage number of a graph
• scientific article; zbMATH DE number 5778835 (Why is no real title available?)
• Average lower domination number for some middle graphs
• Exponential independence number of some 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: Average lower domination number of graphs

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