View source for Transiso

==English==

===Adjective===
{{en-adj|-}}

# {{lb|en|maths}} Pertaining to a graph on a finite group whose vertices are the subgroups of a specified order and for which two vertices are adjacent if the sets of all normalized right transversals for each corresponding subgroup contain at least one common element.
#* {{quote-journal|en|year=2015|date=|author=Laxmi Kant Mishra; Brajesh Kumar Sharma|title=On Transiso Graphs of Groups of order less than 32|journal=arXiv|url=http://arxiv.org/abs/1511.04520|doi=|volume=|issue=|pages=
|passage=We have also discussed the completeness of '''transiso''' graphs for the groups of order less than <math>32</math>.. }}

===Anagrams===
* {{anagrams|en|a=ainorsst|arsonist}}

{{cln|en|3-syllable words}}