Abstract
A subgraph H of a graph G is said to be convex if for every pair of vertices in H ,a nyu-v geodesic in G lies entirely in H. We define the convex subgraph polynomial of G as the genereting function of the sequenceci(G)� ∞=1 where ci(G) is the number of convex subgraphs of G of order i. In this paper, we established some properties of this polynomial and relate graph theoretic concepts with algebraic properties of this polynomial. Moreover, we generated the explicit forms of the convex subgraph polynomials of some special graphs. Lastly, we have shown that the sum of the zeros of this polynomial is the negative of the the coefficient of x |V (G)|−1 and the product of the zeros is (−1) |V (G)| .
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.
