The secure domination number of Cartesian products of small graphs with paths and cycles

Michael Haythorpe, Alex Newcombe

Research output: Contribution to journal › Article › peer-review

Fingerprint

Dive into the research topics of 'The secure domination number of Cartesian products of small graphs with paths and cycles'. Together they form a unique fingerprint.

Computer Science

Physics