ID 145
Author
Ishihara, Toru Faculty of Integrated Arts and Sciences, The University of Tokushima, Tokushima University Educator and Researcher Directory KAKEN Search Researchers
Content Type
Departmental Bulletin Paper
Description
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 Title
Journal of mathematics, the University of Tokushima
ISSN
13467387
NCID
AA11595324
Volume
36
Start Page
1
End Page
6
Sort Key
1
Published Date
2003-02-25
Remark
公開日:2010年1月24日で登録したコンテンツは、国立情報学研究所において電子化したものです。
EDB ID
FullText File
language
eng
departments
Science and Technology