トップ   新規 一覧 検索 最終更新   ヘルプ   最終更新のRSS

20130126 の履歴(No.10)


Hakata Workshop 2013

~ Combinatrics and its Applications~

THIS IS A PROVISIONAL VERSION

 

This is a satellite seminar of the 11th Japan-Korea Workshop on Algebra and Combinatorics . Our purpose of this meeting is giving an opportunity to make a speech and to commuticate with reserchers who study verious fields not only Combinatorics.

Further information is available from the organizers below.

Organizers

Supported by

Date

  • January 26, 2013. 9:30-18:00

Location

Program

January 26 (Saturday) at Room I in Reference Eki Higashi Building.

  • 9:30--10:05 Akihiro Munemasa (Tohoku University)
    • TBA
  • 10:10--10:45 Minwon Na (Tohoku University)
    • TBA
  • (break)
  • 11:00--11:35 Michael Dobbins (KAIST)
    • TBA
  • 11:40--12:15 Aleksandar Jurišić (University of Ljubljana)
    • TBA
  • 12:20--15:10 Poster Session 「数学ソフトウェア紹介」(Introduction to Mathematical Software) (and break)
    • TBA
  • 15:15--16:15 Xiao-Dong Zhang (Shanghai Jiao Tong University)
    • The algebraic connectivity of graphs
  • (break)
  • 16:30--17:05 Katsuhiro Ota (Keio University)
    • TBA
  • 17:10--17:45 Yota Otachi (JAIST)
    • The path-distance-width of hypercubes

Abstract

Xiao-Dong Zhang (Shanghai Jiao Tong University)

  • Title:The algebraic connectivity of graphs
  • Abstract:

Let be a simple graph of order and be its Laplacian matrix, where and are the degree diagonal and adjacency matrices, respectively. The the second smallest eigenvalue of is called the algebraic connectivity of In this talk, we survey some new results and progress on the algebraic connectivity. In particular, we present some relationships between the algebraic connectivity and the graph parameters, such as the clique number, the matching number, the independence number, the isoperimetric number, etc.

Yota Otachi (JAIST)

  • Title: The path-distance-width of hypercubes
  • Abstract:

The path-distance-width of a connected graph is the minimum integer satisfying that there is a nonempty subset of such that the number of the vertices with distance from is at most for any nonnegative integer . We present a general lower bound on the path-distance-width of graph, and determine the path-distance-width of hypercubes by using the lower bound. We also discuss the applicability of the lower bound to other graphs.