- 追加された行はこの色です。
- 削除された行はこの色です。
* Hakata Workshop 2013 [#z008da3b]
''～ Combinatrics and its Applications～''
&color(red){THIS IS A PROVISIONAL VERSION};
#br
This is a satellite seminar of [[the 11th Japan-Korea Workshop on Algebra and Combinatorics :http://comb.math.kyushu-u.ac.jp/?20130124]].
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 [#xb11a6e1]
-[[Yoshihiro Mizoguchi:http://imi.kyushu-u.ac.jp/~ym/]] (Kyushu University),~
-Hayato Waki (Kyushu University),~
-Mitsugu Hirasaka (Pusan National University),~
-[[Tetsuji Taniguchi:http://researchmap.jp/tetsuzit-14/]] (Matsue College of Technology),~
-Osamu Shimabukuro (Sojo University)
-[[Laboratory of Advanced Software in Mathematics, Institute of Mathematics for Industry, Kyushu University:http://www.imi.kyushu-u.ac.jp/eng/academic_staffs/department/34]]
**Supported by [#l7bc435b]
-[[Global COE Program "Education and Research Hub for Mathematics-for-Industry":http://gcoe-mi.jp/]]
**Date [#i35500dd]
-January 26, 2013. 9:30-18:00
**Location [#vcadf025]
-Seminar Room I (2F) in Reference Eki Higashi Building.
1-16-14 Hakata-Eki-Higashi, Hakata-Ku, Fukuoka City, 812-0013
(see http://www.re-rental.com/ , [[Google maps:http://maps.google.com/maps?f=q&source=s_q&hl=en&geocode=&q=%E7%A6%8F%E5%B2%A1%E5%B8%82%E5%8D%9A%E5%A4%9A%E5%8C%BA%E5%8D%9A%E5%A4%9A%E9%A7%85%E6%9D%B11%E4%B8%81%E7%9B%AE16-14&aq=&sll=33.590188,130.425417&sspn=0.012888,0.021157&ie=UTF8&hq=&hnear=%E6%97%A5%E6%9C%AC,+%E7%A6%8F%E5%B2%A1%E7%9C%8C%E7%A6%8F%E5%B2%A1%E5%B8%82%E5%8D%9A%E5%A4%9A%E5%8C%BA%E5%8D%9A%E5%A4%9A%E9%A7%85%E6%9D%B1%EF%BC%91%E4%B8%81%E7%9B%AE%EF%BC%91%EF%BC%96%E2%88%92%EF%BC%91%EF%BC%94&ll=33.591064,130.424795&spn=0.012887,0.021157&z=16]] )
**Program [#h6d29d6d]
***January 26 (Saturday) at Room I in Reference Eki Higashi Building. [#s883cdcb]
-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 「[[数学ソフトウェア紹介:http://comb.math.kyushu-u.ac.jp/?plugin=attach&pcmd=open&file=cfp_for_comb.pdf&refer=20130126]]」(Introduction to Mathematical Software) (and break)
--TBA
-15:15--16:15 Xiao-Dong Zhang (Shanghai Jiao Tong University)
--TBA
--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 [#sb7c7865]
***Xiao-Dong Zhang (Shanghai Jiao Tong University) [#wec50930]
-Title:The algebraic connectivity of graphs
-Abstract:
Let &mimetex(G); be a simple graph of order &mimetex(n); and
&mimetex( L(G)=D(G)-A(G) ); be its Laplacian matrix, where &mimetex( D(G)); and &mimetex( A(G) ); are the degree diagonal and adjacency matrices, respectively.
The the second smallest eigenvalue of &mimetex( L(G) ); is called the algebraic connectivity of &mimetex(G.);
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) [#h17d65f1]
-Title: The path-distance-width of hypercubes
-Abstract:
The path-distance-width of a connected graph &mimetex(G); is the minimum
integer &mimetex(w); satisfying
that there is a nonempty subset of &mimetex(S \subseteq V(G)); such that the
number of the vertices
with distance &mimetex(i); from &mimetex(S); is at most &mimetex(w); for any nonnegative integer &mimetex(i);.
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.
