International Journal of Mathematics and Mathematical Sciences
Volume 10 (1987), Issue 3, Pages 519-524
doi:10.1155/S0161171287000619
Some general classes of comatching graphs
E.J. Farrell
and S.A. Wahid
Department of Mathematics, The University of the West Indies, St. Augustine, Trinidad and Tobago
Abstract
Some sufficient conditions are given for two graphs to have the same matching polynomial (comatching graphs). Several general classes of comatching graphs are given. Also, techniques are discussed for extending certain pairs of comatching graphs to larger pairs of comatching graphs.