DIFFERENTIABILITY OF SOME
Let be a simple graph and be the maximum degree of G. The polynomial representation of G, denoted by is the polynomial over of the form where is the number of vertices in G with degree i for each The derivative of is A connected graph G is said to be semi-differentiable if there exists a graph such that A graph if it exists, is a semi-derivative of G. A semi-differentiable graph G is differentiable if is unique. This unique semi-derivative of G is then denoted by G' and is called the derivative of G.
In this paper, we examined the differentiability of some prime graphs of
differentiability of a graph.