#### Filter Results:

- Full text PDF available (38)

#### Publication Year

1997

2017

- This year (4)
- Last 5 years (23)
- Last 10 years (47)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Manoj Changat, Joseph Mathews
- Discrete Mathematics
- 1999

Convexity invariants like Caratheodory, Helly and Radon numbers are computed for triangle path convexity in graphs. Unlike minimal path convexities, the Helly and Radon numbers behave almost uniformly for triangle path convexity. c © 1999 Elsevier Science B.V. All rights reserved

- 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 vertices in the profile. Starting from some nice and useful properties of the remoteness function in hypercubes, the remoteness function is studied in arbitrary… (More)

- Manoj Changat, Henry Martyn Mulder, Gerard Sierksma
- Discrete Mathematics
- 2005

A feasible family of paths in a connected graphG is a family that contains at least one path between any pair of vertices in G. Any feasible path family defines a convexity on G. Well-known instances are: the geodesics, the induced paths, and all paths. We propose a more general approach for such ‘path properties’. We survey a number of results from this… (More)

- Manoj Changat, Joseph Mathews
- Discrete Mathematics
- 2004

The induced path transit function J (u; v) in a graph consists of the set of all vertices lying on any induced path between the vertices u and v. A transit function J satis2es monotone axiom if x; y∈ J (u; v) implies J (x; y) ⊆ J (u; v). A transit function J is said to satisfy the Peano axiom if, for any u; v; w∈V; x∈ J (v; w), y∈ J (u; x), there is a z ∈ J… (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 (median) set of a graph G. It is proved that for arbitrary graphs G and J and a positive integer r ≥ 2, there exists a connected graph H such that G is the… (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 set of all profiles on G and has as output the set of antimedians of a profile. It is a typical location function for finding a location for an obnoxious… (More)

- Bijo S. Anand, Manoj Changat, Sandi Klavzar, Iztok Peterin
- Graphs and Combinatorics
- 2012

Geodesic convex sets, Steiner convex sets, and induced path convex sets of lexicographic products of graphs are characterized. The geodesic case in particular rectifies [3, Theorem 3.1].

- Manoj Changat, G. N. Prasanth, Joseph Mathews
- Discrete Mathematics
- 2009

The geodesic and induced path transit functions are the two well-studied interval functions in graphs. Two important transit functions related to the geodesic and induced path functions are the triangle path transit functions which consist of all vertices on all u, v-shortest (induced) paths or all vertices adjacent to two adjacent vertices on all u,… (More)

- Hiran H. Lathabai, Thara Prabhakaran, Manoj Changat
- 2014 International Conference on Data Science…
- 2014

Interactions among the scientific community implicitly and explicitly reflects technological and scientific progress in any industry. Direct interactions can be found in the scientific publications and are evident from various affiliations in such publications. In this work, important finding about Information technology for engineering is revealed using… (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 = i. It is proved that the strong product of graphs is strongly distance-balanced if and only if both factors are strongly distance-balanced. It is also proved… (More)