Craig Larson

Assistant Professor
Department of Mathematics and Applied Mathematics
Virginia Commonwealth University

email: clarson@vcu.edu


Teaching

My office is 4106 Harris Hall. In Fall 2011 I will be teaching Linear Algebra (MATH 310) Precalculus (MATH 151), an Honors module (HONR 399), and team-teaching Graph Theory (MATH 591).



Papers & Notes

Refereed

14. E. DeLaVina and C. E. Larson, A Parallel Algorithm for Computing the Critical Independence Number and Related Sets, submitted.

13. L. Eroh, R. Gera, C. Kang, C. E. Larson, and E. Yi, Domination in Functigraphs, to appear in Discussiones Mathematicae Graph Theory.

12. C. E. Larson and R. Pepper, Graphs with Equal Independence and Annihilation Numbers, Electronic Journal of Combinatorics, 18(1) 2011.

11. E. DeLaVina, C. E. Larson, R. Pepper, and B. Waller, A Characterization of Graphs where the Independence Number Equals the Radius, to appear in Graphs and Combinatorics.

10. C. E. Larson, The Critical Independence Number and an Independence Decomposition, European Journal of Combinatorics 32(2), 2011, 294--300.

9. G. Abay-Asmeron, R. Hammack, C. E. Larson, D. T. Taylor, Notes on the independence number in the Cartesian product of graphs, Disquisitiones Mathematica Graph Theory 31(1), 2011, 25--35.

8. E. DeLaVina, C. Larson, R. Pepper and B. Waller, On total domination and support vertices of a tree, AKCE International Journal of Graphs and Combinatorics, 7 (1), 2010, 85--95.

7. E. DeLaVina, C. E. Larson, R. Pepper, and B. Waller, Graffiti.pc on the 2-domination number of a graph, Congressus Numerantium 203, 2010, 15--32.

6. G. Abay-Asmerom, R. Hammack, C. E. Larson, and D. Taylor, Direct Product Factorization of Bipartite Graphs with Bipartite-Switching Involutions, SIAM Journal on Discrete Mathematics 20(4), 2010, 2042--2052.

5. E. DeLaVina, C. E. Larson, R. Pepper, and B. Waller, Graffiti.pc on the total domination number of a tree, Congressus Numerantium 195, 2009, 5--18.

4. C. E. Larson, A Note on Critical Independence Reductions, Bulletin of the Institute of Combinatorics and its Applications 5, 2007, 34--46.

3. C. E. Larson, A Survey of Research in Automated Mathematical Conjecture-making, in Graphs and Discovery, ed. by S. Fajtlowicz, P. W. Fowler, P. Hansen, M. F. Janowitz and F. S. Roberts, DIMACS, 2005, 297--318.

2. S. Fajtlowicz and C. E. Larson, Graph-theoretic Independence as a Predictor of Fullerene Stability, Chemical-Physics Letters, 377/5-6, 2003, 485--490.

1. C. E. Larson, Intelligent Machinery and Mathematical Discovery, Graph Theory Notes of the New York Academy of Science XLII, 2002, 8--17.

Other

1. C. E. Larson, Technology, Education and the Single-Salary Schedule, Notices of the American Mathematical Society, May 2006, 525.



Miscellany



comments to: clarson@vcu.edu