Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
A generalization of the chromatic polynomial of a cycle
Authors: Julian A. Allagan
– 0.11 Mb
Abstract
We prove that if an edge of a cycle on vertices is extended by adding vertices, then the the chromatic polynomial of such generalized cycle is:
J.A. Allagan
Department of Mathematics & Physics,
Troy University
Troy, Alabama
E-mail:
Department of Mathematics & Physics,
Troy University
Troy, Alabama
E-mail:
Fulltext
– 0.11 Mb
Contents
- An Automatic Proof of Euler's Formula
- A generalization of the chromatic polynomial of a cycle
- Nash equilibria sets in mixed extension of 2x2x2 games
- The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving
- On a k-clique-join of a class of partitionable graphs
- On quasistability radius of a vector trajectorial problem with a principle of optimality generalizing Pareto and lexicographic principles
- The solution of problem of objects classification as the method of restoration of objects images
- Generic Interfaces for Managing Web Data
- Variable Bit Permutations: Linear Characteristics and Pure VBP-Based Cipher
- Abstracts of Dr. Thesis
