DSpace About DSpace Software

Dyuthi @ CUSAT >
Computer Applications >
Faculty >
Dr. Kannan Balakrishnan >

Please use this identifier to cite or link to this item: http://purl.org/purl/4216

Title: The median function on graphs with bounded profiles
Authors: Kannan, Balakrishnan
Sandi, Klavzar
Manoj, Changat
Keywords: Consensus
Median function
Local property
Median graph
Consensus strategy
Issue Date: 31-Dec-2007
Publisher: Elsevier
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.
Description: Discrete Applied Mathematics 156 (2008) 2882–2889
URI: http://dyuthi.cusat.ac.in/purl/4216
Appears in Collections:Dr. Kannan Balakrishnan

Files in This Item:

File Description SizeFormat
The median function on graphs with bounded profiles.pdfpdf400.64 kBAdobe PDFView/Open
View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback