Abstract
Let be the family of monophonic sets of a graph with cardinality and let Then the monophonic polynomial of is defined as , where is the monophonic number of . In this paper we have determined the sufficient condition for the monophonic set of . Also, we have calculated the monophonic polynomial of the cartesian product of some specific graphs by generating function method.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
