💡 Words with a Similar Meaning to "Semisymmetric"
Found via reverse dictionary — words that share a conceptual meaning.
| Word | Definition |
|---|---|
| semi-transitive | (graph theory, of a graph) Such that there exists a finite vertex set so that for any vertex there exists another vertex in that finite set and an injective homomorphism of the graph that maps the second vertex to the first vertex. |
| antisymmetrical | (mathematics) antisymmetric |
| quasisymmetric | (mathematics) Almost but not quite symmetric. |
| transitive | (grammar, of a verb) Taking a direct object or objects. |
| quasi-transitive | (graph theory, of a graph) Such that its vertex set can be partitioned into finitely many sets, so that there exists an automorphism mapping a vertex to another vertex if and only if the two vertices belong to the same set in that partition. |
| bidirectednoun | (mathematics) Describing a graph, each of whose edge has an independent orientation at each end |
| semi-isotropic | (mathematics) partially isotropic |
| semisimplicial | — |
| subsymmetrical | Somewhat symmetrical |
| assosymmetric | (mathematics) (more or less) associative and also symmetric |
| semipositive | Partially positive in attitude etc. |
| hyperconnected | Making intense use of telecommunications networks. |
| transiso | (mathematics) 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. |
| semicontiguous | (mathematics) Partially contiguous |
| nonbidiagonal | (mathematics) Not bidiagonal |
| antisymmetrized | (mathematics) Made antisymmetric. |
| isotoxal | (geometry, of a polytope or tiling) That has symmetries which act transitively on its edges. |
| quasiseparable | (mathematics, of a graph) That becomes disconnected when a suitable subgraph is removed |
| antisymmetric | (set theory, order theory, of a binary relation R on a set S) Having the property that, for any two distinct elements of S, at least one is not related to the other via R; equivalently, having the property that, for any x, y ∈ S, if both xRy and yRx then x=y. |
| triangle-free | (graph theory) Of an undirected graph in which no three vertices form a triangle of edges. |
Translate “Semisymmetric” into Another Language
Pick a language — the word will be pre-filled in the translator.