Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: bipartite

Sortuj według:

Ogranicz wyniki do:

The Median Problem on k-Partite Graphs

100%

Pravas K., Vijayakumar A.

Discussiones Mathematicae Graph Theory

2015

tom 35

nr 3

439-446

In a connected graph G, the status of a vertex is the sum of the distances of that vertex to each of the other vertices in G. The subgraph induced by the vertices of minimum (maximum) status in G is called the median (anti-median) of G. The median problem of graphs is closely related to the optimization problems involving the placement of network servers, the core of the entire networks. Bipartite graphs play a significant role in designing very large interconnection networks. In this paper, we answer a problem on the structure of medians of bipartite graphs by showing that any bipartite graph is the median (or anti-median) of another bipartite graph. Also, with a different construction, we show that the similar results hold for k-partite graphs, k ≥ 3. In addition, we provide constructions to embed another graph as center in both bipartite and k-partite cases. Since any graph is a k-partite graph, for some k, these constructions can be applied in general

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Pravas K.

1 Vijayakumar A.

1 2015

Wyniki wyszukiwania

The Median Problem on k-Partite Graphs