end user satisfaction (eus) is one of the most widely used measures in assessing (efficiency/ effectiveness) of an information system. the goal of this research is to identify influential factors on (eus), based on justice theory. so we identified 8 influential factors on (eus) such as interactional justice, distributive justice, information system (is) performance expectation, equitable relate...

In this paper we introduce the common minimal equitable and vertex minimal equitable dominating graph and we get characterize the common minimal equitable and vertex minimal equitable dominating graph which are either connected or complete, some new results of these graphs are obtained. Mathematics Subject Classification: 05C70

Background: Definite data regarding the incidence and distribution of renal tumours in eastern India is not known. For better management, as it is essential to identify patients with poor prognosis, prognostic factors like stage, nuclear grade and their relationship to molecular markers are also unclear in this region. The purpose of our study was to assess the spectrum of adu...

We study the diffusion of epidemics on networks that are partitioned into local communities. The gross structure of hierarchical networks of this kind can be described by a quotient graph. The rationale of this approach is that individuals infect those belonging to the same community with higher probability than individuals in other communities. In community models the nodal infection probabili...

In the forecasting of binary events, verification measures that are ‘‘equitable’’ were defined by Gandin and Murphy to satisfy two requirements: 1) they award all random forecasting systems, including those that always issue the same forecast, the same expected score (typically zero), and 2) they are expressible as the linear weighted sum of the elements of the contingency table, where the weig...

In many applications of graph colouring the sizes of colour classes should not be too large. For example, in scheduling jobs (some of which could be performed at the same time), it is not good if the resulting schedule requires many jobs to occur at some specific time. An application of this type is discussed in [8]. A possible formalization of this restriction is the notion of equitable colour...

This paper describes an exact algorithm for the Equitable Coloring Problem, based on the well known DSatur algorithm for the classic Coloring Problem with new pruning rules specifically derived from the equity constraint. Computational experiences show that our algorithm is competitive with those known in literature.