Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
774 4 |
Ultima descărcare din IBN: 2022-01-04 13:18 |
Căutarea după subiecte similare conform CZU |
512.56+519.174 (1) |
Algebră (400) |
Analiză combinatorică. Teoria grafurilor (115) |
SM ISO690:2012 ALLAGAN, Julian-A.. Chromatic Polynomials Of Some (m, l)− Hyperwheels. In: Computer Science Journal of Moldova, 2014, nr. 1(64), pp. 21-36. ISSN 1561-4042. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Computer Science Journal of Moldova | ||||||
Numărul 1(64) / 2014 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
CZU: 512.56+519.174 | ||||||
Pag. 21-36 | ||||||
|
||||||
Descarcă PDF | ||||||
Rezumat | ||||||
In this paper, using a standard method of computing the chromatic polynomial of hypergraphs, we introduce a new reduction theorem which allows us to find explicit formulae for the chromatic polynomials of some (complete) non-uniform (m, l)−
hyperwheels and non-uniform (m, l)−hyperfans. These hypergraphs, constructed through a “join” graph operation, are some generalizations of the well-known wheel and fan graphs, respectively. Further, we revisit some results concerning these graphs
and present their chromatic polynomials in a standard form that involves the Stirling numbers of the second kind. |
||||||
Cuvinte-cheie chromatic polynomial, hyperfan, hyperwheel, Stirling numbers |
||||||
|