Last Updated
：2025/12/02
quasi-transitive
Adjective
not-comparable
of a graph
Japanese Meaning
グラフ理論における用語で、グラフの頂点集合を有限個の部分集合に分割できること、その分割内でのみ自動同型写像により頂点が移される（つまり、頂点が同じ部分集合に属している場合にのみ自動同型写像で相互に写せる）性質を意味する。 / すなわち、グラフ内の各頂点が有限個のグループに分類され、同じグループ内の頂点同士は自動同型写像により対応付けられるが、異なるグループ間ではそのような対応が成立しないという特徴を表す。
Quizzes for review
(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.
音声機能が動作しない場合はこちらをご確認ください
See correct answer
quasi-transitive
During the conference, she explained how a quasi-transitive graph's symmetry properties allow one to reduce complex enumeration problems by grouping vertices into finitely many equivalence classes under automorphisms.
See correct answer
During the conference, she explained how a quasi-transitive graph's symmetry properties allow one to reduce complex enumeration problems by grouping vertices into finitely many equivalence classes under automorphisms.
音声機能が動作しない場合はこちらをご確認ください
English - English
Word Edit Setting
- Users who have edit permission for words - All Users
- Screen new word creation
- Screen word edits
- Screen word deletion
- Screen the creation of new headword that may be duplicates
- Screen changing entry name
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Sentence Edit Setting
- Users who have edit permission for sentences - All Users
- Screen sentence deletion
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Quiz Edit Setting
- Users who have edit permission for quizzes - All Users
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
