| dc.contributor.author |
Kannan, Balakrishnan |
|
| dc.contributor.author |
Bresar, B |
|
| dc.contributor.author |
Manoj, Changat |
|
| dc.contributor.author |
Klavzar, S |
|
| dc.contributor.author |
Kovse, M |
|
| dc.contributor.author |
Subhamathi, A R |
|
| dc.date.accessioned |
2014-07-22T06:30:38Z |
|
| dc.date.available |
2014-07-22T06:30:38Z |
|
| dc.date.issued |
2010-09-01 |
|
| dc.identifier.uri |
http://dyuthi.cusat.ac.in/purl/4203 |
|
| dc.description |
Networks vol 56(2),pp 90-94 |
en_US |
| dc.description.abstract |
The distance DG(v) of a vertex v in an undirected graph G is the sum of the
distances between v and all other vertices of G. The set of vertices in G with maximum
(minimum) distance is the antimedian (median) set of a graph G. It is proved that for
arbitrary graphs G and J and a positive integer r 2, there exists a connected graph H
such that G is the antimedian and J the median subgraphs of H, respectively, and that
dH(G, J) = r. When both G and J are connected, G and J can in addition be made
convex subgraphs of H. |
en_US |
| dc.description.sponsorship |
CUSAT |
en_US |
| dc.language.iso |
en |
en_US |
| dc.publisher |
Wiley Subscription Services, Inc., A Wiley Company |
en_US |
| dc.subject |
facility location problems |
en_US |
| dc.subject |
median sets |
en_US |
| dc.subject |
antimedian sets |
en_US |
| dc.subject |
convex subgraphs |
en_US |
| dc.title |
Simultaneous Embeddings Of Graphs As Median And Antimedian Subgraphs |
en_US |
| dc.type |
Article |
en_US |