Bulletin of Pure & Applied Sciences- Mathematics and Statistics
  • Year: 2014
  • Volume: 33e
  • Issue: 2

On matching polynomial in graphs

1Associate Professor, N.M.C. College, Marthandam-629165, Kanyakumari District, Tamilnadu. E-mail: devaraj_jacob@yahoo.co.in

2Research Scholar, N.M.C.College, Marthandam-629165, Kanyakumari District, Tamilnadu.. E-mail: sowras@gmail.com

Abstract

In this paper we find the matching polynomial for some well known graphs such as Chvatal graph, Grotzsch graph, Bidiakis cube, Bislit cube, Soifer graph, Fritsch graph and also we discuss recurrence relations for triangular book graph, fan graph and star related graphs. Moreover we discuss the relation between the matching polynomial of fan graph Fmn for m=1 and m=2.

Keywords

Perfect matching, chvatal graph, grotzsch graph, soifer graph, fritsch graph, triangular book graph, fan graph, star related graph