On the Alon-Tarsi Number of Some Line and Total graphs
This work discusses the Alon-Tarsi number of line graphs and total graphs. In addition, we also discuss the Alon-Tarsi number of some Erdos-Faber-Lovasz (EFL) graphs.
arXiv subjects
Publications and source records attributed to S. Prajnanaswaroopa.
This work discusses the Alon-Tarsi number of line graphs and total graphs. In addition, we also discuss the Alon-Tarsi number of some Erdos-Faber-Lovasz (EFL) graphs.
The Alon-Tarsi number of a polynomial is a parameter related to the exponents of its monomials. For graphs, their Alon-Tarsi number is the Alon-Tarsi number of their graph polynomials. As such, it provides an upper bound on their choice and online choice numbers. In this paper, we obtain the Alon-Tarsi number of some complete multipartite graphs, line graphs of some complete graphs of even order, and line graphs of some other regular graphs.
In this paper, we have obtained the total chromatic as well as equitable and neighborhood sum distinguishing total chromatic numbers of some classes of the circulant graphs.