Futaba Fujie-Okamoto


Associate Professor of Mathematics
Mathematics Department
University of Wisconsin - La Crosse
office1016 Cowley Hall
phone608-785-6608
emailffujie@uwlax.edu

    Spring 2012 schedule

  Murphy Learning Center

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. Modular neighbor-distinguishing edge colorings of graphs.
    R. Jones, K. Kolasinski, F. Okamoto, and P. Zhang. Journal of Combinatorial Mathematics and Combinatorial Computing. 76 (2011) 159-175.
  2. Set colorings in perfect graphs.
    R. Gera, F. Okamoto, C. W. Rasmussen, and P. Zhang. Mathematica Bohemica. 136:1 (2011) 61-68.
  3. The sigma chromatic number of a graph.
    G. Chartrand, F. Okamoto, and P. Zhang. Graphs and Combinatorics. 26:6 (2010) 755-773.
  4. Rainbow trees in graphs and generalized connectivity.
    G. Chartrand, F. Okamoto, and P. Zhang. Networks. 55:4 (2010) 360-367.
  5. A solution to the checkerboard problem.
    F. Okamoto, E. Salehi, and P. Zhang. International Journal of Computational and Applied Mathematics. 5:4 (2010) 447-458.
  6. Neighbor-distinguishing vertex colorings of graphs.
    G. Chartrand, F. Okamoto, and P. Zhang. Journal of Combinatorial Mathematics and Combinatorial Computing. 74 (2010) 223-251.
  7. The tree connectivity of regular complete bipartite graphs.
    F. Okamoto and P. Zhang. Journal of Combinatorial Mathematics and Combinatorial Computing. 74 (2010) 279-293.
  8. 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. 73 (2010) 77-84.
  9. The local metric dimension of a graph.
    F. Okamoto, B. Phinezy, and P. Zhang. Mathematica Bohemica. 135:3 (2010) 239-255.
  10. A note on 2-distance chromatic numbers of graphs.
    F. Okamoto and P. Zhang. AKCE International Journal of Graphs and Combinatorics. 7:1 (2010) 5-9.
  11. On multiset colorings of graphs.
    F. Okamoto, E. Salehi, and P. Zhang. Discussiones Mathematicae Graph Theory. 30:1 (2010) 137-153.
  12. On local metric dimensions of graphs.
    F. Okamoto, B. Phinezy, and P. Zhang. Journal of Combinatorial Mathematics and Combinatorial Computing. 72 (2010) 243-259.
  13. Nontrivial solutions to a checkerboard problem.
    M. Heires, R. Jones, F. Okamoto, W. Renzema, and J. Roberts. Involve. 3:1 (2010) 109-127.
  14. A checkerboard problem and modular colorings of graphs.
    F. Okamoto, E. Salehi, and P. Zhang. Bulletin of the Institute of Combinatorics and Its Applications. 58 (2010) 29-47.
  15. The set chromatic number of a graph.
    G. Chartrand, F. Okamoto, C. W. Rasmussen, and P. Zhang. Discussiones Mathematicae Graph Theory. 29 (2009) 545-561.
  16. Set vertex colorings and joins of graphs.
    F. Okamoto, C. W. Rasmussen, and P. Zhang. Czechoslovak Mathematical Journal. 59 (2009) 929-941.
  17. A note on graphs with prescribed order and rainbow index.
    F. Okamoto and P. Zhang. Congressus Numerantium. 197 (2009) 121-127.
  18. On modular colorings of caterpillars.
    F. Okamoto, E. Salehi, and P. Zhang. Congressus Numerantium. 197 (2009) 213-220.
  19. 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. 198 (2009) 31-37.
  20. Results and open problems on Hamiltonian labelings of graphs.
    F. Okamoto, W. Renzema, and P. Zhang. Congressus Numerantium. 198 (2009) 189-206.
  21. Detour antipodal graphs.
    G. L. Johns, F. Okamoto, and P. Zhang. Journal of Combinatorial Mathematics and Combinatorial Computing. 70 (2009) 65-83.
  22. The multiset chromatic number of a graph.
    G. Chartrand, F. Okamoto, E. Salehi, and P. Zhang. Mathematica Bohemica. 134 (2009) 191-209.
  23. The metric chromatic number of a graph.
    G. Chartrand, F. Okamoto, and P. Zhang. Australasian Journal of Combinatorics. 44 (2009) 273-286.
  24. Neighborhood-rainbow colorings of graphs.
    F. Okamoto, B. Phinezy, and P. Zhang. Congressus Numerantium. 192 (2008) 5-18.
  25. On upper traceable numbers of graphs.
    F. Okamoto and P. Zhang. Mathematica Bohemica. 133 (2008) 389-405.
  26. The upper traceable number of a graph.
    F. Okamoto, V. Saenpholphat, and P. Zhang. Czechoslovak Mathematical Journal. 58 (2008) 271-287.
  27. 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.
  28. 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).
  29. On γ-labelings of oriented graphs.
    F. Okamoto, V. Saenpholphat, and P. Zhang. Mathematica Bohemica. 132 (2007) 185-203.
  30. Graphs with prescribed traceable number and related parameters.
    F. Okamoto and P. Zhang. Congressus Numerantium. 188 (2007) 11-32.
  31. On detectable factorizations of regular graphs.
    H. Escuadro, F. Okamoto, and P. Zhang. Congressus Numerantium. 185 (2007) 175-186.
  32. On the irregular chromatic number of a graph.
    F. Okamoto, M. Radcliffe, and P. Zhang. Congressus Numerantium. 181 (2006) 129-150.
  33. A characterization of graphs whose Hamiltonian and upper Hamiltonian numbers differ by 1.
    F. Okamoto and P. Zhang. Congressus Numerantium. 180 (2006) 129-144.
  34. Circulants and a three-color conjecture.
    H. Escuadro, F. Okamoto, and P. Zhang. Congressus Numerantium. 178 (2006) 33-55.
  35. Measures of traceability in graphs.
    F. Okamoto, V. Saenpholphat, and P. Zhang. Mathematica Bohemica. 131 (2006) 63-83.
  36. On detectable factorizations of cubic graphs.
    H. Escuadro, F. Okamoto, and P. Zhang. Journal of Combinatorial Mathematics and Combinatorial Computing. 56 (2006) 47-63.
  37. Detectable colorings of graphs.
    G. Chartrand, H. Escuadro, F. Okamoto, and P. Zhang. Utilitas Mathematica. 69 (2006) 13-32.
  38. The rainbow connectivities of small cubic graphs.
    G. L. Johns, F. Okamoto, and P. Zhang. Ars Combinatoria. Accepted.
  39. The maximum traceable number of a graph.
    F. Okamoto. Ars Combinatoria. Accepted.
  40. A four colorings theorem.
    G. Chartrand, S. T. Hedetniemi, F. Okamoto, and P. Zhang. Ars Combinatoria. Accepted.
  41. The total traceable number of a graph.
    F. Okamoto and P. Zhang. Utilitas Mathematica. Accepted.
  42. A note on bounds for the maximum traceable number of a graph.
    F. Okamoto. Ars Combinatoria. Accepted.
  43. On the nonplanarity of powers of paths.
    G. Chartrand, F. Okamoto, and P. Zhang. Utilitas Mathematica. Accepted.
  44. The singular chromatic number of a graph.
    K. Kolasinski, J. Lin, C. Lumduanhom, F. Okamoto, and B. Phinezy. Ars Combinatoria. Accepted.
  45. Rainbow trees in small cubic graphs.
    F. Fujie-Okamoto, J. Lin, and P. Zhang. Journal of Combinatorial Mathematics and Combinatorial Computing. Accepted.
  46. Color-sensitive checkerboards.
    R. Jones, K. Kolasinski, F. Okamoto, and P. Zhang. Congressus Numerantium. Accepted.
  47. On traceable and upper traceable numbers of graphs.
    F. Fujie-Okamoto. Ars Combinatoria. Accepted.
  48. Vertex-rainbow colorings of graphs.
    F. Fujie-Okamoto, K. Kolasinski, J. Lin, and P. Zhang. Discussiones Mathematicae Graph Theory. Accepted.
  49. The k-metric colorings of a graph.
    F. Fujie-Okamoto, W. Renzema, and P. Zhang. Mathematica Bohemica. Accepted.
  50. The total detection numbers of graphs.
    H. Escuadro and F. Fujie-Okamoto. Journal of Combinatorial Mathematics and Combinatorial Computing. Accepted.
  51. Monochromatic-bichromatic Ramsey numbers.
    G. Chartrand, F. Fujie-Okamoto, K. Kolasinski, and P. Zhang. Bulletin of the Institute of Combinatorics and Its Applications. Accepted.
  52. On distance-defined neighbor-distinguishing sets in graphs.
    F. Fujie-Okamoto, B. Phinezy, and P. Zhang. Utilitas Mathematica. Accepted.
  53. On the forcing connected geodetic number and the connected geodetic number of a graph.
    H. A. Ahangar, F. Fujie-Okamoto, and V. Samodivkin. Ars Combinatoria. Accepted.
  54. Monochromatic-rainbow Ramsey numbers with a specified number of colors.
    F. Fujie-Okamoto, R. Jones, K. Kolasinski, and P. Zhang. Congressus Numerantium. Accepted.
  55. On modular chromatic indexes of graphs.
    F. Fujie-Okamoto, R. Jones, K. Kolasinski, and P. Zhang. Journal of Combinatorial Mathematics and Combinatorial Computing. Accepted.
  56. Efficient computation of the modular chromatic numbers of trees.
    F. Fujie-Okamoto and T. G. Will. Journal of Combinatorial Mathematics and Combinatorial Computing. Accepted.
  57. On modular edge-graceful graphs.
    F. Fujie-Okamoto, R. Jones, K. Kolasinski, and P. Zhang. Graphs and Combinatorics. Accepted.

Research Presentations

  1. Neighbor-distinguishing locating sets in graphs.
    The 43rd Southeastern International Conference on Graph Theory, Combinatorics and Computing.
    Florida Atlantic University, Boca Raton, FL. March 5, 2012.
  2. The k-metric colorings of a graph.
    The 42nd Southeastern International Conference on Graph Theory, Combinatorics and Computing.
    Florida Atlantic University, Boca Raton, FL. March 7, 2011.
  3. Modular edge-graceful graphs.
    The Joint Mathematics Meetings. New Orleans, LA. January 6, 2011.
  4. Cents and sensitivity.
    The 41st Southeastern International Conference on Graph Theory, Combinatorics and Computing.
    Florida Atlantic University, Boca Raton, FL. March 8, 2010.
  5. 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.
  6. 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.
  7. Rainbow colorings and rainbow connectivity of graphs.
    University of Louisville, Louisville, KY. February 18, 2009.
  8. The rainbow index of a graph.
    The Joint Mathematics Meetings.
    Washington, D.C. January 8, 2009.
  9. 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.
  10. Three colorings in graphs.
    MathFest. Madison, WI. July 31, 2008.
  11. The rainbow connectivity of regular graphs.
    SIAM Conference on Discrete Mathematics.
    University of Vermont, Burlington, VT. June 19, 2008.
  12. A four colorings theorem.
    The 39th Southeastern International Conference on Graph Theory, Combinatorics and Computing.
    Florida Atlantic University, Boca Raton, FL. March 3, 2008.
  13. Rainbow connectivities of graphs.
    The Joint Mathematics Meetings. San Diego, CA. January 9, 2008
  14. 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.
  15. From a banquet seating problem to a graph coloring problem.
    Louisiana State University Shreveport, Shreveport, LA. February 8, 2007.
  16. From a banquet seating problem to a graph coloring problem.
    University of Wisconsin La Crosse, La Crosse, WI. January 29, 2007.
  17. From a banquet seating problem to a graph coloring problem.
    The Joint Mathematics Meetings. New Orleans, LA. January 7, 2007.
  18. Hamiltonian walks in graphs.
    Michigan MAA & MichMATYC 2006 Annual Meeting. Calvin College, Grand Rapids, MI. May 6, 2006.
  19. 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