CHROMATICITY OF WHEELS WITH MISSING THREE SPOKES
All graph consider here are simple graphs. For a graph G, Let V(G) and E(G) be the vertex set and a edge set of graph G, respectively. The order of G is denoted by v(G), and the size of G by e(G), i.e. v(G)=|V(G)| and e(G) = |E(G)|. Let P(G,λ) (or simply P(G)) denote the chromatic polynomial of gra...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Faculty of Computer Science and Mathematics, University of Kufa
2014-12-01
|
| Series: | Journal of Kufa for Mathematics and Computer |
| Subjects: | |
| Online Access: | https://journal.uokufa.edu.iq/index.php/jkmc/article/view/2206 |