2 research outputs found
The Maximum Degree-and-Diameter-Bounded Subgraph in the Mesh
The problem of finding the largest connected subgraph of a given undirected
host graph, subject to constraints on the maximum degree and the
diameter , was introduced in \cite{maxddbs}, as a generalization of the
Degree-Diameter Problem. A case of special interest is when the host graph is a
common parallel architecture. Here we discuss the case when the host graph is a
-dimensional mesh. We provide some general bounds for the order of the
largest subgraph in arbitrary dimension , and for the particular cases of
and , we give constructions that result in
sharper lower bounds.Comment: accepted, 18 pages, 7 figures; Discrete Applied Mathematics, 201