A dominating set of a graph is a set S of vertices such that every vertex in the graph is either in S or is adjacent to a vertex in S. The domination number of a graph G, denoted γ (G), is theminimum cardinality of a dominating set ofG. We show that ifG is an n-vertexmaximal outerplanar graph, then γ (G) ≤ (n + t)/4, where t is the number of vertices of degree 2 in G. We show that this bound is...

Planning for a successful MIS implementation requires understanding the effects of the introduction of a new system on the work lives of potential adopters. The effects can be assessed by the MIS practitioner/ change agent ff the agent will first obtain a thorough and specific understanding of the task activities performed by potential adopters, the interactions they engage in as they perform t...

Experiential learning activities (ELAs) that are industry-partnered and real-world problem-based can provide undergraduate students with concrete experiences of using information technologies in the field. Flow theory provides a theoretical basis to guide the design of ELAs, ensuring that the goals are clear, feedback is explicit, and the challenges and skills are balanced. Based on this theory...