【摘 要】
:
A matching M of a graph G is an induced matching if no two edges in M are joined by an edge of G.Let iz(G)denote the total number of induced matchings of G,name
【机 构】
:
School of Mathematical Sciences,South China Normal University,Guangzhou 510631,China