The Maximum Degree-and-Diameter-Bounded Subgraph in the Mesh

Details The Maximum Degree-and-Diameter-Bounded Subgraph in the Mesh The Maximum Degree-and-Diameter-Bounded Subgraph in the Mesh

2012-03-19

arxiv.org/abs/1203.4069v1

Mathematics

Combinatorics

accepted, 18 pages, 7 figures; Discrete Applied Mathematics, 2012

Scientific paper

The problem of finding the largest connected subgraph of a given undirected host graph, subject to constraints on the maximum degree $\Delta$ and the diameter $D$, 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 $k$-dimensional mesh. We provide some general bounds for the order of the largest subgraph in arbitrary dimension $k$, and for the particular cases of $k=3, \Delta = 4$ and $k=2, \Delta = 3$, we give constructions that result in sharper lower bounds.

Affiliated with

Also associated with

No associations

Rating

The Maximum Degree-and-Diameter-Bounded Subgraph in the Mesh does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Maximum Degree-and-Diameter-Bounded Subgraph in the Mesh, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Maximum Degree-and-Diameter-Bounded Subgraph in the Mesh will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-212404