Algorithms for the remoteness function, and the median and antimedian sets in l(1)-graphs

被引：0
作者：
Changat, Manoj [1 ]
Lekha, Divya Sindhu [2 ]
Subhamathi, Ajitha R. [3 ]
机构：
[1] Univ Kerala, Dept Futures Studies, Trivandrum 695034, Kerala, India
[2] Coll Engn & Management Punnapra, Dept Informat Technol, Alappuzha 688003, India
[3] NSS Coll Rajakumari, Dept Comp Applicat, Idukki, Kerala, India
来源：
INTERNATIONAL JOURNAL OF COMPUTING SCIENCE AND MATHEMATICS | 2015年 / 6卷 / 05期
关键词：
hypercube; half-cube; Johnson graph; cocktail-party graph; median; antimedian; majority rule; consensus function; median graph; l(1)-graph; algorithm; remoteness function; computing science; mathematics;
D O I：
10.1504/IJCSM.2015.072962
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
The median (antimedian) set of a profile of vertices of a graph G is the set of vertices. that minimise (maximise) the remoteness value. The median and antimedian problem of profiles on graphs is one of the basic models of desirable (as well as obnoxious) facility location problem in networks. The medians and antimedians behave nicely in classes of graphs like complete graphs, hypercubes and paths. In this paper, we study more classes of graphs in which the medians and antimedians have a nice structure, which admit a scale-embedding into hypercubes known as l(1)-graphs and design algorithms for both (median and antimedian) problems. We particularly discuss the cases of half-cubes, Johnson graphs and cocktail-party graphs.
引用
收藏
页码：480 / 491
页数：12
相关论文
共 14 条
12