Equalityof Secure Domination and Inverse Secure Domination Numbers

DOI10.22147/JUSPS-A/280601MaRDI QIDQ5745446zbMATH OpenOpenAlexFDO

Authors V. R. Kulli

Publication date 5 June 2018

Published in Journal of Ultra Scientist of Physical Sciences Section A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.22147/jusps-a/280601

zbMATH Keywords

dominating setsecure dominating setinverse secure dominating setinverse secure domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Equality of domination and inverse domination numbers.
• Secure domination and secure total domination in graphs
• Note on the secure-domination number of a graph
• SECURE DOMINATING SETS AND SECURE DOMINATION POLYNOMIALS OF CYCLES
• Upper secure domination number of a graph
• A characterization of trees with equal independent domination and secure domination numbers
• Secure domination subdivision number of a graph
• On equality in an upper bound for the equivalence domination number
• Perfect secure domination in graphs
• A note on the domination equalities

Cited in

(2)

• Equality of domination and inverse domination numbers.
• Secure equitability in graphs

This page was built for publication: Equalityof Secure Domination and Inverse Secure Domination Numbers

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