Chromatic Polynomial of some specific Graphs

Hello Readers

Today, I am writing on a very important topic of Graph theory, i.e.

“Chromatic Polynomial” that tells us the total number of different ways to color properly a given graph G using λ or fewer colors. In this post i have discussed chromatic polynomials of some specific Graphs like null graph, path, complete graph and complete bipartite graphs etc.

IMG_20170418_111955
Enter a caption

 

IMG_20170418_112038

Thank you for reading.

In my next post, i will be posting a decomposition theorem that is useful in finding the chromatic polynomials of any finite graph.

Stay connected, Stay learned

Dr. Namita Tiwari

 

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

w

Connecting to %s