Prefer a chat interface with context about you and your work?
The Maximum Number of Dominating Induced Matchings
Abstract A matching M of a graph G is a dominating induced matching (DIM) of G if every edge of G is either in M or adjacent with exactly one edge in M . We prove sharp upper bounds on the number of DIMs of a graph G and characterize …