# Search results for: Manoj Changat

*md*(

*u*,

*v*) defined as $$md(u,v)=max\{\overrightarrow{d}(u,v), \overrightarrow{d}(v,u)\}$$ md(u,v)=max{d→(u,v),d→(v,u)} is a metric, where $$\overrightarrow{d}(u,v)$$ d→(u,v) denote the length of a shortest directed $$u-v$$ u-v path in

*D*. The boundary, contour, eccentricity and...

Scientometrics > 2018 > 117 > 3 > 1611-1644

Scientometrics > 2018 > 117 > 3 > 1871-1904

Discussiones Mathematicae Graph Theory > 2017 > 38 > 1 > 39-48

Discrete Applied Mathematics > 2017 > 228 > C > 50-59

Discrete Applied Mathematics > 2017 > 227 > C > 44-57

Scientometrics > 2017 > 110 > 2 > 711-737

Bulletin of the Malaysian Mathematical Sciences Society > 2016 > 39 > 1 > 123-134

*I*satisfies the Pasch axiom were characterized by Chepoi in 1994. In this...

Discrete Optimization > 2015 > 17 > Complete > 80-88

Physica A: Statistical Mechanics and its Applications > 2015 > 429 > Complete > 157-168

Discrete Mathematics > 2015 > 338 > 6 > 885-894

Technological Forecasting and Social Change > 2015 > 91 > C > 124-145

Discrete Optimization > 2014 > 12 > C > 150-154

*P*is the edge-union of the covering and the incomparability graph of

*P*. In this paper, the cographs that are cover-incomparability graphs are characterized, and the forbidden isometric subposet characterization of the posets whose cover-incomparability graphs are cographs is proved. In addition, some properties of the cover-incomparability chordal graphs...

Discrete Mathematics > 2013 > 313 > 8 > 951-958

Graphs and Combinatorics > 2012 > 28 > 1 > 77-84

*J*-convex (alias induced path convex) sets of lexicographic products of graphs are characterized. The geodesic case in particular rectifies Theorem 3.1 in Canoy and Garces (Graphs Combin 18(4):787–793, 2002).

Discrete Mathematics > 2011 > 311 > 22 > 2601-2609

Discrete Applied Mathematics > 2010 > 158 > 16 > 1752-1759