167 research outputs found
Minimum Light Numbers in the -Game and Lit-Only -Game on Unicyclic and Grid Graphs
Consider a graph each of whose vertices is either in the ON state or in the OFF state and call the resulting ordered bipartition into ON vertices and OFF vertices a configuration of the graph. A regular move at a vertex changes the states of the neighbors of that vertex and hence sends the current configuration to another one. A valid move is a regular move at an ON vertex. For any graph let be the minimum integer such that given any starting configuration of there must exist a sequence of valid moves which takes to a configuration with at most ON vertices provided there is a sequence of regular moves which brings to a configuration in which there are ON vertices. The shadow graph of a graph is obtained from by deleting all loops. We prove that if is unicyclic and give an example to show that the bound is tight. We also prove that if is a two-dimensional grid graph and if is a two-dimensional grid graph but not a path and
Research and Technology, 1989
Selected research and technology activities at Ames Research Center, including the Moffett Field site and the Dryden Flight Research Facility, are summarized. These accomplishments exemplify the Center's varied and highly productive research efforts for 1989
Machine learning and Monte Carlo based data analysis methods in cosmic dust research
This work applies miscellaneous algorithms from the fields Machine Learning and Computational Numerics on the research field Cosmic Dust. The task is to determine the scientific and technical potential of using different methods. Here, the methods are applied on two different projects: the meteor camera system Canary Island Long-Baseline Observatory (CILBO) and the Cassini in-situ dust telescope Cosmic-Dust-Analyzer (CDA)
- …