Flipped classroom is one approach of active learning leading to better students’ learning, abilities, and academic performance. The aim of this study is to evaluate the effect of applying the flipped classroom approach to MIS course, to examine the antecedents of engagement intention after participating the flipped classroom by peers, and to guide key factors of success student presentations. T...

This article reports the results of an experimental analysis of the impact of MIS design variables on managers" evaluations of subordinates" performances. The experiment involved examining whether different ways of reporting a specific standard cost accounting situation resulted in differences in managers’ evaluations. When actual costs differed significantly from standard, it was found that th...

The goal of this paper is to find vertex disjoint even cycles in graphs. For this purpose, define a θ-graph to be a pair of vertices u, v with three internally disjoint paths joining u to v. Given an independence number α and a fixed integer k, the results contained in this paper provide sharp bounds on the order f(k, α) of a graph with independence number α(G) ≤ α which contains no k disjoint ...

An asteroidal triple is an independent set of three vertices in a graph such that every two of them are joined by a path avoiding the closed neighborhood of the third. Graphs without asteroidal triples are called AT-free graphs. In this paper, we show that every AT-free graph admits a vertex ordering that we call a 2-cocomparability ordering. The new suggested ordering generalizes the cocompara...

Web-based learning has been suggested to be the future of all types of distance learning. This study was undertaken to identify the impact of student learning styles, learning patterns, and other selected factors on their learning performance in a Web Course Tools (WebCT) MIS graduate course. Six specific research questions were developed and 76 graduate students participated in this study. It ...

It is proved that there are triangle-free intersection graphs of line segments in the plane with arbitrarily small ratio between the maximum size of an independent set and the total number of vertices.

Over the past few years, our institution has been in the process of rethinking the structure of our College of Business curriculum. This is motivated by three major factors: Demands of industry for the inclusion of “soft skills” in our curriculum, the recent emphasis by AACSB on assessment of student learning, and dissatisfaction with the performance of the core MIS course. This paper describes...

A graph is called well-covered if every maximal independent set of vertices of G is a maximum independent set; recall that S is independent if no two of its vertices are adjacent. In this paper we define the concept of well-covered by monochromatic paths graphs which is a variation of well-covered graphs. We consider some classical constructions of graphs: G-join of graphs and duplication of a ...

This paper investigates output-size sensitiveness of construction of OBDD by analyzing the maximal independent set problem of a graph, which would give several insights to e cient manipulation of Boolean functions by OBDD and graph theory.

The independence polynomial i(G, x) of a graph G is the generating function of the numbers of independent sets of each size. A graph of order n is very well-covered if every maximal independent set has size n/2. Levit and Mandrescu conjectured that the independence polynomial of every very well-covered graph is unimodal (that is, the sequence of coefficients is nondecreasing, then nonincreasing...