#### Filter Results:

- Full text PDF available (9)

#### Publication Year

2007

2017

- This year (0)
- Last 5 years (7)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Kannan Balakrishnan, Bostjan Bresar, +4 authors Ajitha R. Subhamathi
- Discrete Applied Mathematics
- 2009

A profile on a graph G is any nonempty multiset whose elements are vertices from G. The corresponding remoteness function associates to each vertex x âˆˆ V (G) the sum of distances from x to theâ€¦ (More)

- Kannan Balakrishnan, Manoj Changat, Iztok Peterin, Simon Spacapan, Primoz Sparl, Ajitha R. Subhamathi
- Eur. J. Comb.
- 2009

A graph G is strongly distance-balanced if for every edge uv of G and every i â‰¥ 0 the number of vertices x with d(x, u) = d(x, v) âˆ’ 1 = i equals the number of vertices y with d(y, v) = d(y, u) âˆ’ 1 =â€¦ (More)

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â€¦ (More)

The set of vertices that maximize (minimize) the remoteness is the antimedian (median) set of the profile. It is proved that for an arbitrary graph G and S âŠ† V (G) it can be decided in polynomialâ€¦ (More)

- Bostjan Bresar, Manoj Changat, Ajitha R. Subhamathi, Aleksandra Tepeh
- Discussiones Mathematicae Graph Theory
- 2010

The periphery graph of a median graph is the intersection graph of its peripheral subgraphs. We show that every graph without a universal vertex can be realized as the periphery graph of a medianâ€¦ (More)

- Kannan Balakrishnan, Bostjan Bresar, Manoj Changat, Sandi Klavzar, Matjaz Kovse, Ajitha R. Subhamathi
- Algorithmica
- 2008

The median (antimedian) set of a profile Ï€=(u 1,â€¦,u k ) of vertices of a graph G is the set of vertices x that minimize (maximize) the remoteness âˆ‘ i d(x,u i ). Two algorithms for median graphs G ofâ€¦ (More)

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â€¦ (More)

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â€¦ (More)

- Ajitha R. Subhamathi
- 2016 International Conference on Communicationâ€¦
- 2016

Speckle pattern is a form of multiplicative noise which blurs the ultrasound images. It reduces the contrast and resolution of ultrasound images which results in poor interpretation of imageâ€¦ (More)

- Kannan Balakrishnan, Manoj Changat, Henry Martyn Mulder, Ajitha R. Subhamathi
- Discrete Math., Alg. and Appl.
- 2012

An antimedian of a profile Ï€ = (x1, x2, . . . , xk) of vertices of a graph G is a vertex maximizing the sum of the distances to the elements of the profile. The antimedian function is defined on theâ€¦ (More)