z-logo
open-access-imgOpen Access
Median Sets and Median Number of a Graph
Author(s) -
R. Ram Kumar,
Balakrishnan Kannan
Publication year - 2012
Publication title -
isrn discrete mathematics
Language(s) - English
Resource type - Journals
ISSN - 2090-7788
DOI - 10.5402/2012/583671
Subject(s) - combinatorics , mathematics , median , wheel graph , graph , graph power , discrete mathematics , distance regular graph , bound graph , line graph , geometry
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 , for , 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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom