Abstract
Let G be a graph on n vertices. Denote by f(G) the minimum size of a matching M in G such that M is uniquely extendable to a perfect matching in G. The prism of G is defined as G□K2, that is, the Cartesian product of G with the complete graph on 2 vertices. Assume that there exists an involutory matrix A with zero diagonal such that the graph described by the zero/non-zero pattern of off-diagonal entries of A is isomorphic to G. It is shown that f(G□K2)=n2 if G is bipartite. This generalizes a known result. The quantity f for prisms of some families of graphs are determined.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
