Pairs of graded graphs, together with the Fomin property graph duality, are rich combinatorial structures providing among other a framework for enumeration. The prototypical example is one Young integer partitions, allowing us to connect number standard tableaux and numbers permutations. Here, we use operads, that algebraic devices abstracting notion composition objects, build pairs graphs. For...