Characterization and chromatic number of triangle-free graphs with diameter 2

Abstract

In this paper, we consider triangle-free graphs with diameter 2. If a triangle-free graph G with diameter 2 is not isomorphic to a star, then the radius of G is also 2, where such a graph is also called a 2-self-centered graph. Shekarriz et al. [A characterization for 2-self-centered graphs, Discuss. Math. Graph Theory 38 (2018), 27--37.] gave a characterization of 2-self-centered graphs. However, there is a slight flaw in their characterization. Thus, in this paper, we modify it and prove an accurate characterization of those graphs. Furthermore, by using our characterization, we prove some results concerning the chromatic number of triangle-free graphs with diameter 2.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…