115 research outputs found

    Choice Number and Energy of Graphs

    Get PDF
    The energy of a graph G, denoted by E(G), is defined as the sum of the absolute values of all eigenvalues of G. It is proved that E(G)>= 2(n-\chi(\bar{G}))>= 2(ch(G)-1) for every graph G of order n, and that E(G)>= 2ch(G) for all graphs G except for those in a few specified families, where \bar{G}, \chi(G), and ch(G) are the complement, the chromatic number, and the choice number of G, respectively.Comment: to appear in Linear Algebra and its Application

    Harmonious Coloring of Trees with Large Maximum Degree

    Get PDF
    A harmonious coloring of GG is a proper vertex coloring of GG such that every pair of colors appears on at most one pair of adjacent vertices. The harmonious chromatic number of GG, h(G)h(G), is the minimum number of colors needed for a harmonious coloring of GG. We show that if TT is a forest of order nn with maximum degree Δ(T)≥n+23\Delta(T)\geq \frac{n+2}{3}, then h(T)= \Delta(T)+2, & if $T$ has non-adjacent vertices of degree $\Delta(T)$; \Delta(T)+1, & otherwise. Moreover, the proof yields a polynomial-time algorithm for an optimal harmonious coloring of such a forest.Comment: 8 pages, 1 figur
    • …
    corecore