Craig Larson
Associate Professor


email: clarson@vcu.edu 

My office is 4106 Harris Hall. In Fall 2015 I will be teaching Elementary Number Theory (Math 305) and Network Models (OPER 635).
21. C. E. Larson and N. Van Cleemput, Automated Conjecturing I: Fajtlowicz's Dalmatian Heuristic Revisited, Artificial Intelligence 231 (2016) 1738.
20. C. E. Larson and N. Van Cleemput, Forcing Independence, Croatica Chemica Acta, Vol.86, No.4, Dec. 2013, 469475.
19. G. Brinkmann, C. E. Larson, J. Souffriaua, N. Van Cleemput, Construction of Planar 4connected Triangulations, Ars Mathematica Contemporanea, Vol 9, No 2 (2015).
18. C. E. Larson, L. Mitchell, B. Lins, Graphs of Unitary Matrices and Positive Definite Zero Forcing, Reports on Mathematical Physics (ROMP), 72 (3), December 2013, 311320.
17. R. Gera, C. E. Larson, C. Rasmussen, and R. Pepper, Independence in Function Graphs, to appear in Journal of Combinatorial Mathematics and Combinatorial Computing (JCMCC).
16. D. J. Klein and C. E. Larson, Eigenvalues of Saturated Hydrocarbons, Journal of Mathematical Chemistry 51(6) 2013, 16081618.
15. C. E. Larson and R. Pepper, Three Bounds for the Independence Number of a Graph, Bulletin of the Institute of Combinatorics and its Applications 70, 2014, 8696.
14. E. DeLaVina and C. E. Larson, A Parallel Algorithm for Computing the Critical Independence Number and Related Sets, Ars Mathematica Contemporanea 6(2) 2013, 237245.
13. L. Eroh, R. Gera, C. Kang, C. E. Larson, and E. Yi, Domination in Functigraphs, Discussiones Mathematicae Graph Theory 32 (2012).
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, Graphs and Combinatorics 28 (2012) 315332.
10. C. E. Larson, The Critical Independence Number and an Independence Decomposition, European Journal of Combinatorics 32(2), 2011, 294300.
9. G. AbayAsmeron, R. Hammack, C. E. Larson, D. T. Taylor, Notes on the independence number in the Cartesian product of graphs, Discussiotnes Mathematica Graph Theory 31(1), 2011, 2535.
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, 8595.
7. E. DeLaVina, C. E. Larson, R. Pepper, and B. Waller, Graffiti.pc on the 2domination number of a graph, Congressus Numerantium 203, 2010, 1532.
6. G. AbayAsmerom, R. Hammack, C. E. Larson, and D. Taylor, Direct Product Factorization of Bipartite Graphs with BipartiteSwitching Involutions, SIAM Journal on Discrete Mathematics 20(4), 2010, 20422052.
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, 518.
4. C. E. Larson, A Note on Critical Independence Reductions, Bulletin of the Institute of Combinatorics and its Applications 5, 2007, 3446.
3. C. E. Larson, A Survey of Research in Automated Mathematical Conjecturemaking, in Graphs and Discovery, ed. by S. Fajtlowicz, P. W. Fowler, P. Hansen, M. F. Janowitz and F. S. Roberts, DIMACS, 2005, 297318.
2. S. Fajtlowicz and C. E. Larson, Graphtheoretic Independence as a Predictor of Fullerene Stability, ChemicalPhysics Letters, 377/56, 2003, 485490.
1. C. E. Larson, Intelligent Machinery and Mathematical Discovery, Graph Theory Notes of the New York Academy of Science XLII, 2002, 817.
Other
2. C. E. Larson, School success requires more than good intentions, Sept. 13, 2015.
1. C. E. Larson, Technology, Education and the SingleSalary Schedule, Notices of the American Mathematical Society, May 2006, 525.
In high school I was a Congressional Page, ran cross country and track (I ran a 4:50 mile as a sophomore), and was pretty geeky. I went to the University of Houston on a National Merit scholarship. In college I studied philosophy as well as math, and have advanced degrees in both. I taught for many years in the math department at the University of Houston, where I won a teaching award, and met my beautiful wife Jeanine.
We're both big music fans and cat lovers. We like to run, bike, travel, read, eat, see bands, movies and the ballet. We have a little guy, Linus Carl Larson, with us in our adventures. And now I'm at VCU, where I've also won a teaching award.
My research currently involves graph theory, combinatorial optimization and artificial intelligence; but I'm interested in many many many things. In the spring of 2012, I was at Texas A&M University, Galveston, working with, and learning from Doug Klein, a theoretical chemist and chemical graph theorist, and in Spring 2013, I was at Ghent University, Belgium, as a Fulbright Research Scholar, working with Gunnar Brinkmann, an expert in graph algorithms and graph generation.
Be a punk, question authorities, think for yourself, put yourself out there, and give it your all. Stop watching TV. Be active. Do stuff. "Start your own band. Write your own book. Paint your own picture!"
comments to: clarson@vcu.edu