Efficient edge domination in regular graphs

An induced matching of a graph G is a matching having no two edges joined by an edge. An efficient edge dominating set of G is an induced matching M such that every other edge of G is adjacent to some edge in M. We relate maximum induced matchings and efficient edge dominating sets, showing that efficient edge dominating sets are maximum induced matchings, and that maximum induced matchings on regular graphs with efficient edge dominating sets are efficient edge dominating sets. A necessary condition for the existence of efficient edge dominating sets in terms of spectra of graphs is established. We also prove that, for arbitrary fixed p ≥ 3, deciding on the existence of efficient edge dominating sets on p-regular graphs is NP-complete. © 2008 Elsevier B.V. All rights reserved.

Applying the motivation-hygiene theory as a means of measuring learner satisfaction with blended learning courses in higher education

This study describes research on a postgraduate blended learning programme within the Department of Education at the University of Aveiro in Portugal. It is based on a multi-philosophical paradigm and examines students‟ satisfaction levels through the application of Herzberg‟s Motivation and Hygiene Theory. The main question being addressed in this research is: “Can the Motivation and Hygiene Theory be adopted as a means to measure student satisfaction with their blended learning environment?” Embedded within this research question are four fundamental questions which set the scene for the development of this research study and are explored in greater detail in Chapters 4 and 5 respectively: 1. What are the factors responsible for bringing about learning satisfaction with their b-Learning course? 2. What are the factors responsible for bringing about learning dissatisfaction with their b-Learning course? 3. Can these factors be represented as Motivation and Hygiene factors? 4. Will this method of measuring learning satisfaction lead to a set of guidelines that could be considered as a framework for the development of b-Learning courses? The results indicate that the Motivation and Hygiene Theory or an adapted version such as the Enricher and Enabler Theory proposed in this study could be considered as a plausible means of analysing an institution‟s b-Learning processes. The opportunity to carry out future research is evident and can be varied depending on the research objectives in mind. Examples where further exploration would be beneficial lay within the application of this theory to the wider sector; the use of larger samples, focusing on the teachers, as well as the learners and the application of Web 2.0 technologies as means of gathering information. The results of this research will be of great significance to those areas of education that are interested in locating quick and efficient means by which to evaluate their b-Learning and to no lesser extent e-Learning environments.

Efficient domination through eigenvalues

The paper begins with a new characterization of (k,τ)(k,τ)-regular sets. Then, using this result as well as the theory of star complements, we derive a simplex-like algorithm for determining whether or not a graph contains a (0,τ)(0,τ)-regular set. When τ=1τ=1, this algorithm can be applied to solve the efficient dominating set problem which is known to be NP-complete. If −1−1 is not an eigenvalue of the adjacency matrix of the graph, this particular algorithm runs in polynomial time. However, although it does not work in polynomial time in general, we report on its successful application to a vast set of randomly generated graphs.