|
Dyuthi @ CUSAT >
e-SCHOLARSHIP >
Computer Applications >
Faculty >
Dr. Kannan Balakrishnan >
Please use this identifier to cite or link to this item:
http://purl.org/purl/4203
|
| Title: | Simultaneous Embeddings Of Graphs As Median And Antimedian Subgraphs |
| Authors: | Kannan, Balakrishnan
Bresar, B
Manoj, Changat
Klavzar, S
Kovse, M
Subhamathi, A R |
| Keywords: | facility location problems
median sets
antimedian sets
convex subgraphs |
| Issue Date: | 1-Sep-2010 |
| Publisher: | Wiley Subscription Services, Inc., A Wiley Company |
| 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. |
| Description: | Networks vol 56(2),pp 90-94 |
| URI: | http://dyuthi.cusat.ac.in/purl/4203 |
| Appears in Collections: | Dr. Kannan Balakrishnan
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|
