Restrained domination in signed graphs

A signed graph Σ is a graph with positive or negative signs attatched to each of its edges. A signed graph Σ is balanced if each of its cycles has an even number of negative edges. Restrained dominating set D in Σ is a restrained dominating set of its underlying graph where the subgraph induced by the edges across Σ[D : V \ D] and within V \ D is balanced. The set D having least cardinality is called minimum restrained dominating set and its cardinality is the restrained domination number of Σ denoted by γr(Σ). The ability to communicate rapidly within the network is an important application of domination in social networks. The main aim of this paper is to initiate a study on restrained domination in the realm of different classes of signed graphs

Unravelling the Neural Basis of Spatial Delusions After Stroke

International audienc

Brainhack: developing a culture of open, inclusive, community-driven neuroscience

Brainhack is an innovative meeting format that promotes scientific collaboration and education in an open and inclusive environment. Departing from the formats of typical scientific workshops, these events are based on grassroots projects and training, and foster open and reproducible scientific practices. We describe here the multifaceted, lasting benefits of Brainhacks for individual participants, particularly early career researchers. We further highlight the unique contributions that Brainhacks can make to the research community, contributing to scientific progress by complementing opportunities available in conventional formats

Brainhack: Developing a culture of open, inclusive, community-driven neuroscience

Brainhack is an innovative meeting format that promotes scientific collaboration and education in an open, inclusive environment. This NeuroView describes the myriad benefits for participants and the research community and how Brainhacks complement conventional formats to augment scientific progress