Although Software-Defined Networking (SDN) enables flexible network resource allocations for traffic engineering, current literature mostly focuses on unicast communications. Compared to trafficâ€¦ (More)

The first-fit chromatic number of a graph is the number of colors needed in the worst case of a greedy coloring. In this short note, we first give counterexamples to some results by Balogh et al.â€¦ (More)

Viral marketing, a marketing strategy that leverages the influence power in intimate relationship, has become more prevalent due to the popularity of online social networking services in recentâ€¦ (More)

A proper vertex coloring of a graph G is a partition {A1, A2, . . . , Ak} of the vertex set V (G) into stable sets. For a graph G with a positive vertexweight c : V (G) â†’ (0,âˆž), denoted by (G, c),â€¦ (More)

A balanced coloring of a graph G is an ordered pair (R, B) of disjoint subsets R, B âŠ† V (G) with |R| = |B|. The balanced decomposition number f (G) of a connected graph G is the minimum integer fâ€¦ (More)

For a given integer k â‰¥ 2, a balanced k-coloring of a graph G is a mapping c: V (G) â†’ {0, 1, 2, . . . , k} such that |Aj| = |Ajâ€² | for 1 â‰¤ j < j â‰¤ k, where Aj = {v âˆˆ V (G): c(v) = j} for 0 â‰¤ j â‰¤ k.â€¦ (More)

For a partition Î» of an integer, we associate Î» with a slender poset P the Hasse diagram of which resembles the Ferrers diagram of Î». Let X be the set of maximal chains of P . We consider Stanleyâ€™sâ€¦ (More)