24 citations · 130 across the 60 of their papers we have counts for
13 papers · 1 filter
On the maximum and negative frustration indices of graphs
Maximilien Gadouleau, Huiying Zeng
A signed graph is a graph with signatures ( or ) on its edges. A cycle is called positive if the product of its edge signatures is positive, and a signed graph is called ba…
Graphs with minimum fractional domatic number
Maximilien Gadouleau, Nathaniel Harms, George B. Mertzios +1
The domatic number of a graph is the maximum number of vertex disjoint dominating sets that partition the vertex set of the graph. In this paper we consider the fractional variant…
Graphs with minimum degree-based entropy
Yanni Dong, Maximilien Gadouleau, Pengfei Wan +1
The degree-based entropy of a graph is defined as the Shannon entropy based on the information functional that associates the vertices of the graph with the corresponding degrees.…
Dynamical properties of disjunctive Boolean networks
Maximilien Gadouleau
A Boolean network is a mapping , which can be used to model networks of interacting entities, each having a local Boolean state that evolves over ti…
Linear Programming Complementation
Maximilien Gadouleau, George B. Mertzios, Viktor Zamaraev
In this paper we introduce a new operation for Linear Programming (LP), called LP complementation, which resembles many properties of LP duality. Given a maximisation (resp.~minimi…
On fixable families of Boolean networks
Maximilien Gadouleau, Adrien Richard
The asynchronous dynamics associated with a Boolean network is a finite deterministic automaton considered in many applications. The set of states is…
Fixing monotone Boolean networks asynchronously
Julio Aracena, Maximilien Gadouleau, Adrien Richard +1
The asynchronous automaton associated with a Boolean network is considered in many applications. It is the finite deterministic automaton with set of stat…
On the stability and instability of finite dynamical systems with prescribed interaction graphs
Maximilien Gadouleau
The dynamical properties of finite dynamical systems (FDSs) have been investigated in the context of coding theoretic problems, such as network coding, and in the context of hat ga…
Structural aspects of semigroups based on digraphs
James East, Maximilien Gadouleau, James D. Mitchell
Given any digraph without loops or multiple arcs, there is a natural construction of a semigroup of transformations. To every arc of is associate…
Maximum Rank and Asymptotic Rank of Finite Dynamical Systems
Maximilien Gadouleau
A finite dynamical system is a system of multivariate functions over a finite alphabet used to model a network of interacting entities. The main feature of a finite dynamical syste…
Lexicographic identifying codes
Maximilien Gadouleau
An identifying code in a graph is a set of vertices which intersects all the symmetric differences between pairs of neighbourhoods of vertices. Not all graphs have identifying code…
Remoteness of permutation codes
Peter J. Cameron, Maximilien Gadouleau
In this paper, we introduce a new parameter of a code, referred to as the remoteness, which can be viewed as a dual to the covering radius. Indeed, the remoteness is the minimum ra…
Combinatorial representations
Peter J. Cameron, Maximilien Gadouleau, Søren Riis
This paper introduces combinatorial representations, which generalise the notion of linear representations of matroids. We show that any family of subsets of the same cardinality h…