Two algorithms for secure graph domination

Simple item page
dc.contributor.authorBurger AP
dc.contributor.authorde Villiers AP
dc.contributor.authorVan Vuuren JH
dc.date.accessioned2014-07-06T17:14:39Z
dc.date.available2014-07-06T17:14:39Z
dc.date.issued2013
dc.descriptionPlease help populate SUNScholar with the full text of SU research output. Also - should you need this item urgently, please snd us the details and we will try to get hold of the full text as quick possible. E-mail to scholar@sun.ac.za. Thank you.
dc.descriptionEkonomiese En Bestuurswetenskappe
dc.descriptionLogistiek
dc.identifier.citationJournal of Combinatorial Mathematics and Combinatorial Computing
dc.identifier.citation85
dc.identifier.citation321
dc.identifier.citation339
dc.identifier.urihttp://hdl.handle.net/10019.1/87576
dc.titleTwo algorithms for secure graph domination
dc.typeJournal Articles (NON-subsidised)
Files
Collections
2013 - Research Outputs (Non-Accredited)