ID | 145 |
著者 |
石原, 徹
Faculty of Integrated Arts and Sciences, The University of Tokushima,
徳島大学 教育研究者総覧
KAKEN研究者をさがす
|
資料タイプ |
紀要論文
|
抄録 | For any base of the root lattice A_n, we can construct a signed graph naturally. A connected graph is called a Fushimi tree if its all blocks are complete subgraphs. In the present note, a Fushimi tree is said to be simple when by deleting any cut vertex, we have always two its connected components. We prove that a signed graph corresponding to a base of A_n is a simple Fushimi tree. Cameron, Seidel and Cameron [3] defined local switchings of singned graphs. We also show that a simple Fushimi tree is transformed to a line by a sequence of local switchngs.
|
掲載誌名 |
Journal of mathematics, the University of Tokushima
|
ISSN | 13467387
|
cat書誌ID | AA11595324
|
巻 | 36
|
開始ページ | 1
|
終了ページ | 6
|
並び順 | 1
|
発行日 | 2003-02-25
|
備考 | 公開日:2010年1月24日で登録したコンテンツは、国立情報学研究所において電子化したものです。
|
EDB ID | |
フルテキストファイル | |
言語 |
eng
|
部局 |
理工学系
|