| dc.contributor.author |
Kannan, Balakrishnan |
|
| dc.contributor.author |
Sandi, Klavzar |
|
| dc.contributor.author |
Manoj, Changat |
|
| dc.date.accessioned |
2014-07-22T08:44:09Z |
|
| dc.date.available |
2014-07-22T08:44:09Z |
|
| dc.date.issued |
2007-12-31 |
|
| dc.identifier.uri |
http://dyuthi.cusat.ac.in/purl/4216 |
|
| dc.description |
Discrete Applied Mathematics 156 (2008) 2882–2889 |
en_US |
| dc.description.abstract |
The median of a profile = (u1, . . . , uk ) of vertices of a graph G is the set of vertices x that minimize the sum of distances
from x to the vertices of . It is shown that for profiles with diameter the median set can be computed within an isometric
subgraph of G that contains a vertex x of and the r -ball around x, where r > 2 − 1 − 2 /| |. The median index of a graph
and r -joins of graphs are introduced and it is shown that r -joins preserve the property of having a large median index. Consensus
strategies are also briefly discussed on a graph with bounded profiles. |
en_US |
| dc.description.sponsorship |
Cochin University of Science and Technology |
en_US |
| dc.language.iso |
en |
en_US |
| dc.publisher |
Elsevier |
en_US |
| dc.subject |
Consensus |
en_US |
| dc.subject |
Median function |
en_US |
| dc.subject |
Local property |
en_US |
| dc.subject |
Median graph |
en_US |
| dc.subject |
Consensus strategy |
en_US |
| dc.title |
The median function on graphs with bounded profiles |
en_US |
| dc.type |
Article |
en_US |