| dc.contributor.author |
Kannan, Balakrishnan |
|
| dc.contributor.author |
Bostjan, Brešar |
|
| dc.contributor.author |
Manoj, Changat |
|
| dc.contributor.author |
Wilfried, Imrich |
|
| dc.contributor.author |
Sandi, Klavzar |
|
| dc.contributor.author |
Matjaz, Kovse |
|
| dc.contributor.author |
Ajitha, Subhamathi R |
|
| dc.date.accessioned |
2014-07-23T04:28:30Z |
|
| dc.date.available |
2014-07-23T04:28:30Z |
|
| dc.date.issued |
2008-03-25 |
|
| dc.identifier.issn |
1318-4865 |
|
| dc.identifier.uri |
http://dyuthi.cusat.ac.in/purl/4237 |
|
| dc.description |
University of Ljubljana
Institute of Mathematics, Physics and Mechanics
Department of Mathematics
Preprint series, Vol. 46 (2008), 1046 |
en_US |
| dc.description.abstract |
A periphery transversal of a median graph G is introduced as a set of vertices
that meets all the peripheral subgraphs of G. Using this concept, median graphs
with geodetic number 2 are characterized in two ways. They are precisely
the median graphs that contain a periphery transversal of order 2 as well as
the median graphs for which there exists a profile such that the remoteness
function is constant on G. Moreover, an algorithm is presented that decides
in O(mlog n) time whether a given graph G with n vertices and m edges is a
median graph with geodetic number 2. Several additional structural properties
of the remoteness function on hypercubes and median graphs are obtained and
some problems listed |
en_US |
| dc.description.sponsorship |
Cochin University of Science and Technology |
en_US |
| dc.language.iso |
en |
en_US |
| dc.subject |
median graph |
en_US |
| dc.subject |
median set |
en_US |
| dc.subject |
remoteness function |
en_US |
| dc.subject |
geodetic number |
en_US |
| dc.subject |
periphery transversal |
en_US |
| dc.subject |
hypercube |
en_US |
| dc.title |
Median graphs, the remoteness function, periphery transversals, and geodetic number two |
en_US |
| dc.type |
Article |
en_US |