Mesure et action des i-permutations sur les multigraphes multicolores finis et inifinis

Abstract

Among other results, the purpose of this article is to show the existence of an R-space-vector with basis ωij , i, j are integers such that every graph with n vertex n ≥ 3 is the vector: V(n) = Σj=0n-1 αn-1j ωn-1j where αn-1j is the number of sub graphs of type ωn-1j . We deduce that two graphs are isomorphic if for any measure, they have the same number of maximal proper subset with this measure.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…