Futaba Okamoto


Mathematics Department
University of Wisconsin - La Crosse
office1016 Cowley Hall
phone608-785-6608
emailokamoto.futa@uwlax.edu



MTH 175

  Research Seminar Schedule

  Fall 2009 schedule

Research Interest

My research area is graph theory and my research interests include graph structures, graph colorings and labelings, distance in graphs, and traversability in graphs.

Education

2007Ph.D. in Mathematics, Western Michigan University, USA.
Area : Graph Theory
Dissertation : Measures of Traversability in Graphs
Advisor : Professor Ping Zhang
2005M.A. in Mathematics, Western Michigan University, USA.
2003B.S. in Mathematics and B.S. in Physics, Western Michigan University, USA.
Graduated : Summa Cum Laude

Research Publications in Refereed Journals

  1. Set vertex colorings and joins of graphs.
    F. Okamoto, C. W. Rasmussen, and P. Zhang. Czechoslovak Mathematical Journal. 59 (2009) 929-941.
  2. The multiset chromatic number of a graph.
    G. Chartrand, F. Okamoto, E. Salehi, and P. Zhang. Mathematica Bohemica. 134 (2009) 191-209.
  3. The metric chromatic number of a graph.
    G. Chartrand, F. Okamoto, and P. Zhang. Australasian Journal of Combinatorics. 44 (2009) 273-286.
  4. On upper traceable numbers of graphs.
    F. Okamoto and P. Zhang. Mathematica Bohemica. 133 (2008) 389-405.
  5. The upper traceable number of a graph.
    F. Okamoto, V. Saenpholphat, and P. Zhang. Czechoslovak Mathematical Journal. 58 (2008) 271-287.
  6. A three-color problem in graph theory.
    H. Escuadro, F. Okamoto, and P. Zhang. Bulletin of the Institute of Combinatorics and its Applications. 52 (2008) 65-82.
  7. Vertex-distinguishing colorings of graphs (a survey of recent developments).
    H. Escuadro, F. Okamoto, and P. Zhang. AKCE International Journal of Graphs and Combinatorics. 4 (2007).
  8. On γ-labelings of oriented graphs.
    F. Okamoto, V. Saenpholphat, and P. Zhang. Mathematica Bohemica. 132 (2007) 185-203.
  9. Graphs with prescribed traceable number and related parameters.
    F. Okamoto and P. Zhang. Congressus Numerantium. 188 (2007) 11-32.
  10. On detectable factorizations of regular graphs.
    H. Escuadro, F. Okamoto, and P. Zhang. Congressus Numerantium. 185 (2007) 175-186.
  11. On the irregular chromatic number of a graph.
    F. Okamoto, M. Radcliffe, and P. Zhang. Congressus Numerantium. 181 (2006) 129-150.
  12. A characterization of graphs whose Hamiltonian and upper Hamiltonian numbers differ by 1.
    F. Okamoto and P. Zhang. Congressus Numerantium. 180 (2006) 129-144.
  13. Circulants and a three-color conjecture.
    H. Escuadro, F. Okamoto, and P. Zhang. Congressus Numerantium. 178 (2006) 33-55.
  14. Measures of traceability in graphs.
    F. Okamoto, V. Saenpholphat, and P. Zhang. Mathematica Bohemica. 131 (2006) 63-83.
  15. On detectable factorizations of cubic graphs.
    H. Escuadro, F. Okamoto, and P. Zhang. Journal of Combinatorial Mathematics and Combinatorial Computing. 56 (2006) 47-63.
  16. Detectable colorings of graphs.
    G. Chartrand, H. Escuadro, F. Okamoto, and P. Zhang. Utilitas Mathematica. 69 (2006) 13-32.
  17. The rainbow connectivities of small cubic graphs.
    G. L. Johns, F. Okamoto, and P. Zhang. Ars Combinatoria. Accepted.
  18. The maximum traceable number of a graph.
    F. Okamoto. Ars Combinatoria. Accepted.
  19. A note on graphs with prescribed complete coloring numbers.
    G. Chartrand, F. Okamoto, Z. Tuza, and P. Zhang. Journal of Combinatorial Mathematics and Combinatorial Computing. Accepted.
  20. A four colorings theorem.
    G. Chartrand, S. T. Hedetniemi, F. Okamoto, and P. Zhang. Ars Combinatoria. Accepted.
  21. Detour antipodal graphs.
    G. L. Johns, F. Okamoto, and P. Zhang. Journal of Combinatorial Mathematics and Combinatorial Computing. Accepted.
  22. Neighborhood-rainbow colorings of graphs.
    F. Okamoto, B. Phinezy, and P. Zhang. Congressus Numerantium. Accepted.
  23. The total traceable number of a graph.
    F. Okamoto and P. Zhang. Utilitas Mathematica. Accepted.
  24. The set chromatic number of a graph.
    G. Chartrand, F. Okamoto, C. W. Rasmussen, and P. Zhang. Discussiones Mathematicae Graph Theory. Accepted.
  25. A note on bounds for the maximum traceable number of a graph.
    F. Okamoto. Ars Combinatoria. Accepted.
  26. A checkerboard problem and modular colorings of graphs.
    F. Okamoto, E. Salehi, and P. Zhang. Bulletin of the Institute of Combinatorics and Its Applications. Accepted.
  27. Neighbor-distinguishing vertex colorings of graphs.
    G. Chartrand, F. Okamoto, and P. Zhang. Journal of Combinatorial Mathematics and Combinatorial Computing. Accepted.
  28. On multiset colorings of graphs.
    F. Okamoto, E. Salehi, and P. Zhang. Discussiones Mathematicae Graph Theory. Accepted.
  29. The tree connectivity of regular complete bipartite graphs.
    F. Okamoto and P. Zhang. Journal of Combinatorial Mathematics and Combinatorial Computing. Accepted.
  30. Rainbow trees in graphs and generalized connectivity.
    G. Chartrand, F. Okamoto, and P. Zhang. Networks. Accepted.
  31. On local metric dimensions of graphs.
    F. Okamoto, B. Phinezy, and P. Zhang. Journal of Combinatorial Mathematics and Combinatorial Computing. Accepted.
  32. Results and open problems on Hamiltonian labelings of graphs.
    F. Okamoto, W. Renzema, and P. Zhang. Congressus Numerantium. Accepted.
  33. A note on graphs with prescribed order and rainbow index.
    F. Okamoto and P. Zhang. Congressus Numerantium. Accepted.
  34. Realizing lattice points in 3-space as the chromatic numbers of three factors of a complete graph.
    F. Okamoto and C. W. Rasmussen. Congressus Numerantium. Accepted.
  35. On the nonplanarity of powers of paths.
    G. Chartrand, F. Okamoto, and P. Zhang. Utilitas Mathematica. Accepted.
  36. On modular colorings of caterpillars.
    F. Okamoto, E. Salehi, and P. Zhang. Congressus Numerantium. Accepted.
  37. Set colorings in perfect graphs.
    R. Gera, F. Okamoto, C. W. Rasmussen, and P. Zhang. Mathematica Bohemica. Accepted.

Research Presentations

  1. The local metric dimension of a graph.
    The 23rd Midwest Conference on Combinatorics, Cryptography, and Computing (MCCCC).
    Rochester Institute of Technology, Rochester, NY. October 3, 2009.
  2. Powers of paths and planarity.
    The 40th Southeastern International Conference on Graph Theory, Combinatorics and Computing.
    Florida Atlantic University, Boca Raton, FL. March 2, 2009.
  3. Rainbow colorings and rainbow connectivity of graphs.
    University of Louisville, Louisville, KY. February 18, 2009.
  4. The rainbow index of a graph.
    The Joint Mathematics Meetings.
    d Washington, D.C. January 8, 2009.
  5. Rainbow trees in graphs.
    The 22nd Midwest Conference on Combinatorics, Cryptography, and Computing (MCCCC).
    University of Nevada Las Vegas, Las Vegas, NV. October 22, 2008.
  6. Three colorings in graphs.
    MathFest. Madison, WI. July 31, 2008.
  7. The rainbow connectivity of regular graphs.
    SIAM Conference on Discrete Mathematics.
    University of Vermont, Burlington, VT. June 19, 2008.
  8. A four colorings theorem.
    The 39th Southeastern International Conference on Graph Theory, Combinatorics and Computing.
    Florida Atlantic University, Boca Raton, FL. March 3, 2008.
  9. Rainbow connectivities of graphs.
    The Joint Mathematics Meetings. San Diego, CA. January 9, 2008
  10. On measures of traceability in graphs.
    The 38th Southeastern International Conference on Graph Theory, Combinatorics and Computing.
    Florida Atlantic University, Boca Raton, FL. March 5, 2007.
  11. From a banquet seating problem to a graph coloring problem.
    Louisiana State University Shreveport, Shreveport, LA. February 8, 2007.
  12. From a banquet seating problem to a graph coloring problem.
    University of Wisconsin La Crosse, La Crosse, WI. January 29, 2007.
  13. From a banquet seating problem to a graph coloring problem.
    The Joint Mathematics Meetings. New Orleans, LA. January 7, 2007.
  14. Hamiltonian walks in graphs.
    Michigan MAA & MichMATYC 2006 Annual Meeting. Calvin College, Grand Rapids, MI. May 6, 2006.
  15. Measures of traceability in graphs.
    The 37th Southeastern International Conference on Graph Theory, Combinatorics and Computing.
    Florida Atlantic University, Boca Raton, FL. March 6, 2006.

Honors and Awards

2008 The 2008 Kirkman Medal.
The Institute of Combinatorics and its Applications.
2007 Graduate Research and Creative Scholar Award.
The Graduate College, Western Michigan University.
Department Graduate Research Scholar Award.
Department of Mathematics, Western Michigan University.
2006 Charles H. Butler Excellence in Teaching Award.
Department of Mathematics, Western Michigan University.
2003 Western Michigan University Presidential Scholar Award in Physics.
2002 Western Michigan University Presidential Scholar Award in Mathematics.
A. Bruce Clarke Senior Award.
Department of Mathematics, Western Michigan University.
Nathan Nichols Physics Scholarship.
Department of Physics, Western Michigan University.
Wilcox Memorial Award.
Department of Physics, Western Michigan University.
2001 Fred A. Beeler Memorial Scholarship. (twice)
Department of Mathematics, Western Michigan University.
Robert Meagher Memorial Scholarship.
Department of Mathematics, Western Michigan University.
2000 - 2001 Paul Rood Scholarship. (4 times)
Department of Physics, Western Michigan University.
2000 Freshman-Sophomore Prize Competition Award.
Department of Mathematics, Western Michigan University.
1999 - 2002 Top Student Award in Physics. (5 times)
Department of Physics, Western Michigan University.



Here is my cv.



web material: web*citron | night on the planet | fuwafuwa_li