Linear N-Graphs

Authors

Demet Taylan, Suleyman Demirel University, TurkeyFollow
Gulnur Baser, Suleyman Demirel University, TurkeyFollow

Abstract

We call a simple graph G a linear N-graph if its ordinary (vertex) chromatic number equals to the linear chromatic number of its neighborhood complex N(G). We prove that the linearity is preserved under taking joins and multiplication of vertices, and give a complete characterization of linear N-trees.

Author Bio

The place and dates the work was completed: Suleyman Demirel Un., fall of 2006.Status of authors: Undergraduates, expecting a BS degree in math in June, 2007.Status of the paper: extracted from authors final year project.

The place and dates the work was completed: Suleyman Demirel Un., fall of 2006. Status of authors: Undergraduates, expecting a BS degree in math in June, 2007. Status of the paper: extracted from authors final year project.

Faculty Sponsor

Yusuf Civan

Recommended Citation

Taylan, Demet and Baser, Gulnur (2007) "Linear N-Graphs," Rose-Hulman Undergraduate Mathematics Journal: Vol. 8: Iss. 1, Article 9.
Available at: https://scholar.rose-hulman.edu/rhumj/vol8/iss1/9