| dc.contributor.author |
Kannan, Balakrishnan |
|
| dc.contributor.author |
Changat, Manoj |
|
| dc.contributor.author |
Klavzar, Sandi |
|
| dc.contributor.author |
Mathews, Joseph |
|
| dc.contributor.author |
Peterin, Iztok |
|
| dc.contributor.author |
Prasanth, G N |
|
| dc.contributor.author |
Spacapan, Simon |
|
| dc.date.accessioned |
2010-12-06T09:47:39Z |
|
| dc.date.available |
2010-12-06T09:47:39Z |
|
| dc.date.issued |
2008 |
|
| dc.identifier.other |
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 41 (2008), Pages 159–170 |
|
| dc.identifier.uri |
http://dyuthi.cusat.ac.in/xmlui/purl/2009 |
|
| dc.description.abstract |
Antimedian graphs are introduced as the graphs in which for every triple
of vertices there exists a unique vertex x that maximizes the sum of the
distances from x to the vertices of the triple. The Cartesian product of
graphs is antimedian if and only if its factors are antimedian. It is proved
that multiplying a non-antimedian vertex in an antimedian graph yields
a larger antimedian graph. Thin even belts are introduced and proved to
be antimedian. A characterization of antimedian trees is given that leads
to a linear recognition algorithm. |
en_US |
| dc.description.sponsorship |
Cochin University of Science and Technology ,Ministry of Science of Slovenia and by the Ministry of Science and Technology of India |
en_US |
| dc.language.iso |
en |
en_US |
| dc.subject |
Multiplying non-antimedian vertices |
en_US |
| dc.subject |
Optimization |
en_US |
| dc.subject |
Graph theory |
en_US |
| dc.title |
Antimedian graphs |
en_US |
| dc.type |
Working Paper |
en_US |
| dc.contributor.faculty |
Technology |
en_US |