M. Mollard

activity

20122022

most citedOn domination of Cartesian product of directed cycles

2 citations · 2 across the 10 of their papers we have counts for

collaborators

Showing 2012Show all

4 papers · 1 filter

math.CO2012★ 2 cited

On domination of Cartesian product of directed cycles

Michel Mollard

Let $γ (C_{m} □ C_{n})$ be the domination number of the Cartesian product of directed cycles $C_{m}$ and $C_{n}$ for $m, n \geq 2$ . Shaheen [] and Liu and al.[ ], [ ] determined the value of…

math.CO2012

Edge Decompositions of Hypercubes by Paths and by Cycles

Michel Mollard, Mark Ramras

If $H$ is (or is isomorphic to) a subgraph of $G$ , $H$ is said to {\it divide} $G$ if there is an edge-decomposition of $G$ by copies of $E (H)$ , the edge set of $H$ . A more restric…

math.CO2012

Maximal hypercubes in Fibonacci and Lucas cubes

Michel Mollard

The Fibonacci cube $Γ_{n}$ is the subgraph of the hypercube induced by the binary strings that contain no two consecutive 1's. The Lucas cube $Λ_{n}$ is obtained from $Γ_{n}$ by removing…

cs.DM2012

New results on variants of covering codes in Sierpinski graphs

Sylvain Gravier, Matjaz Kovse, Michel Mollard +2

In this paper we study identifying codes, locating-dominating codes, and total-dominating codes in Sierpinski graphs. We compute the minimum size of such codes in Sierpinski graphs…