The maximum number of dominating induced matchings
MC Lin, VA Moyano, D Rautenbach… - Journal of Graph …, 2015 - Wiley Online Library
MC Lin, VA Moyano, D Rautenbach, JL Szwarcfiter
Journal of Graph Theory, 2015•Wiley Online LibraryA 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 all extremal graphs. Our results imply that if G
is a graph of order n, then; provided G is triangle‐free; and provided and G is connected.
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 all extremal graphs. Our results imply that if G
is a graph of order n, then; provided G is triangle‐free; and provided and G is connected.
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 all extremal graphs. Our results imply that if G is a graph of order n, then ; provided G is triangle‐free; and provided and G is connected.
Wiley Online LibraryShowing the best result for this search. See all results