This paper describes the development and evaluation of a haptic interface designed to provide access to line graphs for bind or visually impaired people. Computer-generated line graphs can be felt by users through the sense of touch produced by a PHANToM force feedback device. Experiments have been conducted to test the effectiveness of this interface with both sighted and blind people. The res...

A connected graph G is said to be neighbourly irregular graph if no two adjacent vertices of G have same degree. In this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.

the energy of a graph is equal to the sum of the absolute values of its eigenvalues. two graphs of the same order are said to be equienergetic if their energies are equal. we point out the following two open problems for equienergetic graphs. (1) although it is known that there are numerous pairs of equienergetic, non-cospectral trees, it is not known how to systematically construct any such pa...

Software engineers usually represent problems and solutions using graph-based notations at different levels of abstractions. These notations are often semi-formal, but the use of graph transformation techniques can support reasoning about graphs in many ways, and thus can largely enhance them. Recent work indicates many applications of graph transformation to software engineering and opens new ...

let $r$ be a ring with unity. the undirected nilpotent graph of $r$, denoted by $gamma_n(r)$, is a graph with vertex set ~$z_n(r)^* = {0neq x in r | xy in n(r) for some y in r^*}$, and two distinct vertices $x$ and $y$ are adjacent if and only if $xy in n(r)$, or equivalently, $yx in n(r)$, where $n(r)$ denoted the nilpotent elements of $r$. recently, it has been proved that if $r$ is a left ar...

given a non-abelian finite group $g$, let $pi(g)$ denote the set of prime divisors of the order of $g$ and denote by $z(g)$ the center of $g$. thetextit{ prime graph} of $g$ is the graph with vertex set $pi(g)$ where two distinct primes $p$ and $q$ are joined by an edge if and only if $g$ contains an element of order $pq$ and the textit{non-commuting graph} of $g$ is the graph with the vertex s...

Starting with a conceptual model when designing a web site is the state of the art. A conceptual model helps to grasp and structure the problem domain and is the first step towards a formal representation of the web site, provided that the chosen technology has a formal foundation. Applying the extended entity relationship driven EER/GRAL-approach to specifying graph classes, we show that graph...