TY - JOUR AU - Chakrabarti, Swapan Kumar AU - Pathak, S. R. AU - Yadav, R. N. PY - 2018/08/31 Y2 - 2024/03/29 TI - Local Switching of Simple Fushimi Trees JF - International Journal For Research In Mathematics And Statistics JA - IJRMS VL - 4 IS - 7 SE - Articles DO - 10.53555/ms.v4i7.636 UR - https://gnpublication.org/index.php/ms/article/view/636 SP - 01-05 AB - <p>When we treat with signed graphs corresponding to the root lattice A<sub>n</sub>, 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.</p> ER -