Updated on 2021/05/19

写真a

 
FUJIE Futaba
 
Organization
Graduate School of Mathematics Natural Mathematics Associate professor
Graduate School
Graduate School of Mathematics
Undergraduate School
School of Science
Title
Associate professor

Degree 1

  1. Ph.D. in Mathematics ( 2007.8   Western Michigan University ) 

Research Areas 1

  1. Others / Others  / graph theory

Current Research Project and SDGs 1

  1. Hamiltonicities in Graphs

Professional Memberships 2

  1. Institute of Combinatorics and Its Applications

  2. American Mathematical Society

Awards 1

  1. The 2008 Kirkman Medal

    2008   The Institute of Combinatorics and its Applications  

     More details

    Country:United States

 

Papers 8

  1. The rainbow connectivities of small cubic graphs Reviewed

    F. Fujie-Okamoto, G.L. Johns, P. Zhang

    Ars Combinatoria   Vol. 105   page: 129-147   2012.7

     More details

    Language:English   Publishing type:Research paper (scientific journal)  

  2. The total detection numbers of graphs Reviewed

    H. Escuadro, F. Fujie-Okamoto

    Journal of Combinatorial Mathematics and Combinatorial Computing   Vol. 81   page: 97-119   2012.5

     More details

    Language:English   Publishing type:Research paper (scientific journal)  

  3. Monochromatic-bichromatic Ramsey numbers Reviewed

    G. Chartrand, F. Fujie-Okamoto, K. Kolasinski, P. Zhang

    Bulletin of the Institute of Combinatorics and Its Applications   Vol. 65   page: 72-88   2012.5

     More details

    Language:English   Publishing type:Research paper (scientific journal)  

  4. The k-metric colorings of a graph Reviewed

    F. Fujie-Okamoto, W. Renzema, P. Zhang

    Mathematica Bohemica   Vol. 137 ( 1 ) page: 45-63   2012

     More details

    Language:English   Publishing type:Research paper (scientific journal)  

  5. On the nonplanarity of powers of paths Reviewed

    G. Chartrand, F. Fujie-Okamoto, P. Zhang

    Utilitas Mathematica   Vol. 89   page: 331-341   2012

     More details

    Language:English   Publishing type:Research paper (scientific journal)  

  6. Vertex rainbow colorings of graphs Reviewed

    F. Fujie-Okamoto, K. Kolasinski, J. Lin, P. Zhang

    Discussiones Mathematicae Graph Theory   Vol. 32 ( 1 ) page: 63-80   2012

     More details

    Language:English   Publishing type:Research paper (scientific journal)  

  7. On modular chromatic indexes of graphs Reviewed

    F. Fujie-Okamoto, R. Jones, K. Kolasinski, P. Zhang

    Journal of Combinatorial Mathematics and Combinatorial Computing   Vol. 82   page: 295-306   2012

     More details

    Language:English   Publishing type:Research paper (scientific journal)  

  8. Neighbor-distinguishing metric sets - results and open questions Reviewed

    F. Fujie, B. Phinezy, P. Zhang

    Congressus Numerantium   Vol. 211   page: 5-22   2012

     More details

    Authorship:Lead author   Language:English   Publishing type:Research paper (scientific journal)  

▼display all

Books 1

  1. Covering Walks in Graphs

    F. Fujie, P. Zhang( Role: Joint author)

    Springer  2014 

     More details

    Language:English

Presentations 10

  1. Paths in Hamiltonian graphs International conference

    Futaba FUJIE

    The Joint Mathematics Meetings 2015 

     More details

    Event date: 2015.1

    Language:English   Presentation type:Oral presentation (general)  

    Country:United States  

  2. On covering walks in graphs International conference

    F. Fujie

    The 28th Midwest Conference on Combinatorics, Cryptography, and Computing 

     More details

    Event date: 2014.10

    Language:English   Presentation type:Oral presentation (invited, special)  

    Country:United States  

  3. On covering walks in graphs International conference

    Futaba FUJIE

    The 44th Southeastern International Conference on Combinatorics, Graph Theory, and Computing 

     More details

    Event date: 2013.3

    Language:English   Presentation type:Oral presentation (general)  

    Country:United States  

    Every connected graph G contains a closed walk in which every vertex in G appears at least once. Such a walk is a (vertex) covering walk in G. In particular, a shortest such walk is called a Hamiltonian walk in G and its length is called the Hamiltonian number of G. These concepts were introduced by S. E. Goodman and S. T. Hedetniemi in 1973 and have been studied by many. Some recent results and related topics in this area will be discussed.

  4. On methods of distinguishing vertices using edge labelings International conference

    Futaba FUJIE

    The 2nd Japan-Taiwan Conference on Combinatorics and its Applications 

     More details

    Event date: 2012.11

    Language:English   Presentation type:Oral presentation (general)  

    Country:Japan  

    There have been numerous studies using a variety of methods for the purpose of uniquely identifying the vertices of a graph or distinguishing two vertices whenever they are adjacent. Naturally, many of these methods involve graph colorings and labelings. A graph coloring that allows us to distinguish every two adjacent vertices in a given graph in some manner is said to be neighbor-distinguishing. On the other hand, a graph coloring is vertex-distinguishing if the coloring provides us with a way to distinguish every two vertices in a graph regardless of whether they are adjacent or not.
    In this talk, some edge labelings that give rise to ways of distinguishing vertices are introduced. Let G be a connected graph of size at least 2 and c an edge labeling of G using k labels, say 1, 2, ... , k, where adjacent edges may be assigned the same label. For each vertex v of G, the code of v with respect to c is the k-vector whose i-th coordinate is the number of edges incident with v that are labeled i. The labeling c is called a detectable labeling of G if distinct vertices in G have distinct codes, that is, a detectable labeling of a graph is a vertex-distinguishing edge labeling of the graph. We discuss some recent results in this area of research and related topics.

  5. On covering walks in graphs International conference

    Futaba FUJIE

    The 26th Midwest Conference on Combinatorics, Cryptography and Computing 

     More details

    Event date: 2012.10

    Language:English   Presentation type:Oral presentation (general)  

    Country:United States  

    Every connected graph G contains a closed walk in which every vertex in G appears at least once. Such a walk is a (vertex) covering walk in G. In particular, a shortest such walk is called a Hamiltonian walk in G and its length is called the Hamiltonian number of G. These concepts were introduced by S. E. Goodman and S. T. Hedetniemi in 1973 and have been studied by many. In this talk, we discuss some recent results in this area and related topics.

  6. Neighbor-distinguishing locating sets in graphs International conference

    Futaba FUJIE

    The 43rd Southeastern International Conference on Combinatorics, Graph Theory, and Computing 

     More details

    Event date: 2012.3

    Language:English   Presentation type:Oral presentation (general)  

    Country:United States  

  7. The k-metric colorings of a graph International conference

    Futaba FUJIE

    The 42nd Southeastern International Conference on Combinatorics, Graph Theory, and Computing 

     More details

    Event date: 2011.3

    Language:English   Presentation type:Oral presentation (general)  

    Country:United States  

  8. Modular edge-graceful graphs International conference

    Futaba FUJIE

    The Joint Mathematics Meetings 2011 

     More details

    Event date: 2011.1

    Language:English   Presentation type:Oral presentation (general)  

    Country:United States  

  9. Cents and sensitivity International conference

    Futaba FUJIE

    The 41st Southeastern International Conference on Combinatorics, Graph Theory, and Computing 

     More details

    Event date: 2010.3

    Language:English   Presentation type:Oral presentation (general)  

    Country:United States  

  10. The local metric dimension of a graph International conference

    Futaba FUJIE

    The 23rd Midwest Conference on Combinatorics, Cryptography, and Computing 

     More details

    Event date: 2009.10

    Language:English   Presentation type:Oral presentation (general)  

    Country:United States  

▼display all

 

Teaching Experience (On-campus) 9

  1. 微分積分学I

    2016

  2. Perspectives in Mathematical Sciences III/I (Part 3)

    2016

  3. 微分積分学I

    2015

  4. 微分積分学II

    2015

  5. 微分積分学I

    2014

  6. Perspectives in Mathematical Sciences IV/II (Part 1)

    2013

  7. 微分積分学II

    2013

  8. 微分積分学I

    2013

  9. トポロジー特論I

    2012

▼display all

 

Social Contribution 8

  1. 数学 夏の学校

    Role(s):Lecturer

    愛知県立明和高等学校  数学 夏の学校  愛知県立明和高等学校  2018.8

     More details

    Audience: Junior students, High school students, Teachers

    Type:Visiting lecture

  2. 数学 秋のセミナー

    Role(s):Lecturer

    愛知県立明和高等学校  数学 秋のセミナー  愛知県立明和高等学校  2017.10

     More details

    Audience: Junior students, High school students, Teachers

    Type:Visiting lecture

  3. 数学 夏の学校

    Role(s):Lecturer

    愛知県立明和高等学校  数学 夏の学校  愛知県立明和高等学校  2016.8

     More details

    Audience: Junior students, High school students, Teachers

    Type:Visiting lecture

  4. 数学 夏の学校 ウィンターセミナー

    2015.12

  5. 数学 夏の学校

    2015.8

  6. 数学 夏の学校

    2014.8

  7. NHK公開講座 数学の小径

    2014.3

  8. NHK公開講座 数学の小径

    2013.8

▼display all