Panda, B.S.; Pandey, A.
(2022-09-20)
For a graph G =(V,E), a set M ⊆ E is called a matching in G if no two edges in M share a common vertex. A matching M in G is called an uniquely restricted matching in G if there is no other matching of the same cardinality ...