Quick search
Go!

THE USE OF THE CHROMATIC POLYNOMIAL OF A GRAPH IN ENUMERATIVE COMBINATORICS


CORNEL BERCEANU
Vasile Alecsandri" University of Bacău, Faculty of Sciences, Department of Mathe-matics, Informatics and Educational Sciences, Calea Mărăşeşti 157, Bacău 600115, Romania, e-mail: cornel_berceanu@yahoo.com

Issue:

SSRSMI, Number 1, Volume XXIII

Section:

Volume 23, Number 1

Abstract:

The chromatic polynomial of a graph on the set N={1,2,...,n} is used as an instrument to find the number of possible partitions of N under some particular restraints and the number of functions on N with special properties.

Keywords:

Partition, Bell number, Stirling's numbers, graph, chromatic polynomial.

Code [ID]:

SSRSMI201323V23S01A0002 [0003819]

Full paper:

Download pdf


Copyright (c) 1995-2007 University of Bacu