General Mathematics

    

Structure of Chromatic Polynomials on Quasi - Total Graphs

Authors: R.V.N.SrinivasaRao, J.VenkateswaraRao, T.Nageswara Rao

Total colouring is a combination of vertex and edge colouring. Quasi total coloring of a graph is an assignment of colours to vertices and edges such that distinct colours are assigned to adjacent vertices and edges or incident vertices and edges. This manuscript is going to count the possible number of assignments of different proper colourings of these quasi total graphs of a (p, q) connected graphs with p ≤ 3 and 1≤ q ≤ 3with given number of colours using deletion -contraction algorithm.

Comments: 10 Pages.

Download: PDF

Submission history

[v1] 2014-05-08 00:56:47

Unique-IP document downloads: 300 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus