abstract. suppose g is an nvertex and medge simple graph with edge set e(g). an integervalued function f: e(g) → z is called a flow. tutte was introduced the flow polynomial f(g, λ) as a polynomial in an indeterminate λ with integer coefficients by f(g,λ) in this paper the flow polynomial of some dendrimers are computed.

A new interpretation of transform coding is developed that downplays quantization and emphasizes entropy coding, allowing a comparison of entropy coding methods with different memory requirements. With conventional transform coding, based on computing Karhunen–Loève transform coefficients and then quantizing them, vector entropy coding can be replaced by scalar entropy coding without an increas...