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

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...

in this paper we define a new labeling called skolem odd difference mean labeling and investigate skolem odd difference meanness of some standard graphs. let g = (v,e) be a graph with p vertices and q edges. g is said be skolem odd difference mean if there exists a function f : v (g) → {0, 1, 2, 3, . . . , p + 3q − 3} satisfying f is 1−1 and the induced map f : e(g) → {1, 3, 5, . . . , 2q−1} d...

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.

Let G be an intuitionistic fuzzy graph. Let u and v be two vertices of G. A subset D of V is called a fuzzy equitable dominating set if every v ∈ V − Dthere exist a vertex u ∈ D such that uv ∈ E(G) and |deg(u) − deg(v)| = 1 where deg(u) denotes the degree of vertex u and deg(v) denotes the degree of vertex v and μ2(vi, vj ) = μ1(vi) ∧ μ1(vj ), γ2(vi, vj ) = γ1(vi) ∨ γ1(vj ). The minimum cardina...

Chen, Lih, and Wu conjectured that for r≥3, the only connected graphs with maximum degree at most r that are not equitably r-colorable are Kr,r (for odd r) and Kr+1. If true, this would be a strengthening of the Hajnal–Szemerédi Theorem and Brooks’ Theorem. We extend their conjecture to disconnected graphs. For r≥6 the conjecture says the following: If an r-colorable graph G with maximum degree...