A unified approach to the first derivatives of graph polynomials

The authors define a general polynomial of a graph \(G\) and prove a relation between its first derivative and the polynomials of the subgraphs of \(G\). Let \(f(\Lambda)\) be any function defined on the class of all graphs with the property \(f(\Lambda_ 1)= f(\Lambda_ 2)\) for any isomorphic \(\Lambda_ 1\) and \(\Lambda_ 2\). \(P(G, k)\) denote the sum \(\sum f(\Lambda)\) where \(\Lambda\) is any \(k\)-vertex subgraph of \(G\). The general polynomial of \(G\) is defined as \[ P(G, x)= \sum^ n_{k= 0} P(G, k) x^{n- k}. \] The main result of the paper is the equality \[ {d\over dx} P(G, x)= \sum_{v\in V(G)} P(G- v, x). \] It is shown that matching, independence, characteristic and clique polynomials are special cases of the general polynomial.

Recommendations

Cites work

Cited in

(12)

This page was built for publication: A unified approach to the first derivatives of graph polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1805447)