LOCAL SWITCHING OF SIMPLE FUSHIMI TREES

  • Swapankumar Chakrabarti
Keywords: Signed graph, Root lattice, Combinatorics

Abstract

When we treat with signed graphs corresponding to the root lattice An, a connected graph is called a Fushimi tree if its all blocks are complete subgraphs. A Fushimi tree is said to be simple when by deleting any cut vertex we have its two connected components. Switching defines an equivalent relation in the set of all signed graphs. An equivalent class is called a switching class. Local switching partitions all signed graphs on n vertices into clusters of switching class. In this paper we have discussed about different sequences of local switching.

Downloads

Download data is not yet available.

References

[1] P. J. Cameron, J. J. Seidel and S. V. Tsaranov (1994) J. Algebra, 164, 173-209
[2] [2] P. J. Cameron, J. M. Goethals, J. J. Seidel and E. E. Shult (1976) J. Algebra, 43, 305-327
[3] [3] D. M. Cvetkovic, M. Doob, I. Gutman and A. Torgasev (1991) Annals of Discrete Mathematics, North Roland, Amsterdam
[4] [4] J. E. Humphreys (1989) Reflection Group and Coxeter Group, Cambridge University Press, Cambridge
[5] [5] T. Ishihara (2002) J. Math. Univ. Tokushima, 36, 1-6.
Published
2018-08-04