| dc.contributor.author |
Kannan, Balakrishnan |
|
| dc.contributor.author |
Ram Kumar, r |
|
| dc.date.accessioned |
2014-07-22T07:05:32Z |
|
| dc.date.available |
2014-07-22T07:05:32Z |
|
| dc.date.issued |
2012-10-18 |
|
| dc.identifier.uri |
http://dyuthi.cusat.ac.in/purl/4212 |
|
| dc.description |
International Scholarly Research Network
ISRN Discrete Mathematics
Volume 2012, Article ID 583671, 8 pages
doi:10.5402/2012/583671 |
en_US |
| dc.description.abstract |
A profile is a finite sequence of vertices of a graph. The set of all vertices of the graph which
minimises the sum of the distances to the vertices of the profile is the median of the profile. Any
subset of the vertex set such that it is the median of some profile is called a median set. The number
of median sets of a graph is defined to be the median number of the graph. In this paper, we identify
the median sets of various classes of graphs such as Kp − e, Kp,q forP > 2, and wheel graph and so
forth. The median numbers of these graphs and hypercubes are found out, and an upper bound for
the median number of even cycles is established.We also express the median number of a product
graph in terms of the median number of their factors. |
en_US |
| dc.description.sponsorship |
Cochin University of Science and Technology |
en_US |
| dc.language.iso |
en |
en_US |
| dc.publisher |
Hindawi Publishing Corporation |
en_US |
| dc.title |
Median Sets and Median Number of a Graph |
en_US |
| dc.type |
Article |
en_US |