Crossmark

A Lower Bound for the Domination Number of Triple Cartesian Products of Graphs

Crossref DOI link: https://doi.org/10.1007/s41980-025-01018-7

Published Online: 2026-01-22

Published Print: 2026-02

Update policy: https://doi.org/10.1007/springer_crossmark_policy

Authors

Tout, Omar https://orcid.org/0000-0003-0963-9639
License Information

Text and Data Mining valid from 2026-01-22

Version of Record valid from 2026-01-22
More Information

Article History

Received: 31 March 2025

Accepted: 29 September 2025

First Online: 22 January 2026

Declarations

:

: The author states that there are no conflict of interest.