For a connected and non-complete graph, a new lower bound on its independence number is proved. It is shown that this bound is realizable by the well known efficient algorithm MIN.

This study examines the extent and reasons for the downturn in IS/IT program enrollments since 2001. The current enrollment cycle will be compared with earlier enrollment cycles since the beginning of the modern MIS program in the 1970s. Several notable “mega-trends” that affect the enrollment cycle are suggested, and based on these “mega-trends” and other reasons underlying the downturn, innov...

I review the phenomenology of new physics in low energy processes using the notion of minimal flavor violation (vs. non-minimal flavor violation). I compare the predictions of beyond-the-standard models and show that among certain observables in rare b-decays pattern arise, which allow to distinguish between extensions of the Standard Model. I discuss the status and future of the model independ...

We prove that if G = (VG, EG) is a finite, simple, and undirected graph with κ components and independence number α(G), then there exist a positive integer k ∈ N and a function f : VG → N0 with non-negative integer values such that f(u) ≤ dG(u) for u ∈ VG, α(G) ≥ k ≥ ∑ u∈VG 1 dG(u)+1−f(u) , and ∑ u∈VG f(u) ≥ 2(k − κ). This result is a best-possible improvement of a result due to Harant and Schi...

R. Klein Levinski College Tel A vi v, Israel An m-<1egel1er'a J. Schonheim School of Mathematical Sciences Sackler Faculty of Exact Sciences Tel Aviv Israel every subgraph of which has minimal at most m. An (mI, m2, ... , the set of which can be partitioned into s sets generating rpc,,,prtlvplv We conjecture that such a graph is )J colorable. Partial results is settled. ~VU"Uv',"". but not e...

We give an upper bound on the independence number of the cube of the odd cycle C8n+5. The best known lower bound is conjectured to be the truth; we prove the conjecture in the case 8n + 5 prime and, within 2, for general n.

This Teaching Case has been developed to assist students in introductory first year MIS courses to develop an understanding of business context, while building practical expertise in IS modeling techniques and problem solving. The case has been formulated around a small financial planning practice, in order to work in a learning environment where students may not have had any (or limited) expos...

Several algorithms are presented. The standard algorithm generates all N anticliques of a graph with v vertices in time O(Nv). It can be adapted to e.g. generate all maximum cardinality anticliques, or just one maximum anticlique. The latter is our main achievement and was programmed using the Mathematica 6.0 code. For a random (45, 92)-graph G a maximum anticlique of size 21 was found in 1.344...