Maximum Degree Diameter Bounded Subgraph Problem for Square-Octagonal Lattice

The Maximum Degree Diameter Bounded Subgraph Problem (MaxDDBS) is a quest to determine the largest subgraph embedded in a given host graph in terms of vertices, subject to the constraints of the degree and the diameter. This problem can be considered as a restricted version of the degree diameter problem. This paper considers the Square-Octagonal lattice as the host graph and determines the embedded largest subgraphs for all maximum degrees and diameters.