The medium domination number of a graph

MaRDI QIDQ3018604zbMATH OpenFDO

Authors Duygu Vargör, Pinar Dundar

Publication date 27 July 2011

Full work available at URL http://www.ijpam.eu/contents/2011-70-3/3/index.html

zbMATH Keywords

communication networkdomination numberneighborhoodvulnerability

Mathematics Subject Classification ID

Vertex degrees (05C07) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Network design and communication in computer systems (68M10)

Recommendations

• Average lower domination number for some middle graphs
• The vulnerability of some networks including cycles via domination parameters
• Domination integrity of some graph classes
• scientific article; zbMATH DE number 6712808
• Domination integrity of some path related graphs

Cited in

(6)

• scientific article; zbMATH DE number 6712808 (Why is no real title available?)
• Average lower domination number for some middle graphs
• Counting the numbers of paths of all lengths in symmetric dendrimers and its applications
• Notes on Latin square graphs and their domination numbers
• Mathematical modeling to find the potential number of ways to distribute certain things to certain places in medical field
• Graph Modelling of Social Internet of Things (S-IoT) centered home automation using medium domination approach

This page was built for publication: The medium domination number of a graph

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