Signed graphs have their edges labeled either as positive or negative. Here we introduce two types of signed distance matrix for graphs. We characterize balance in using these matrices and obtain explicit formulae the spectrum some unbalanced also notion distance-compatible partially it.

A signed graph is a whose edges are labeled either positive or negative. Corresponding to the two distance matrices defined for graphs, we define laplacian matrices. We characterize balance in graphs using these and find spectra of some classes unbalanced graphs.

this study considers an eoq inventory model with advance payment policy in a fuzzy situation by employing two types of fuzzy numbers that are trapezoidal and triangular. two fuzzy models are developed here. in the first model the cost parameters are fuzzified, but the demand rate is treated as crisp constant. in the second model, the demand rate is fuzzified but the cost parameters are treated ...

We introduce and study a family of generalized double-layer potentials which are used to build smooth and accurate approximants for the signed distance function. Given a surface, the value of an approximant at a given point is a power mean of distances from the point to the surface points parameterized by the angle they are viewed from the given point. We analyze mathematical properties of the ...

This thesis is concerned with topics related to dense mapping of large scale three-dimensional spaces. In particular, the motivating scenario of this work is one in which a mobile robot with limited computational resources explores an unknown environment using a depth-camera. To this end, low-level topics such as sensor noise, map representation, interpolation, bit-rates, compression are invest...