Excessive generation of mitochondrial reactive oxygen species (ROS) is considered to be initiating event in the development of diabetic nephropathy (DN). Mitochondrial biosynthesis mediated by coactivator PGC-1α and its downstream transcription factors NRF1 and TFAM may be a key target in maintaining mitochondrial function. Resveratrol (RESV), a natural polyphenolic antioxidant, is a potent SIRT1 agonist. In this study we established diabetes mouse and podocyte exposed to high glucose as in vivo and in vitro models to investigate the efficacy and mechanism of RESV on renoprotection. We found that RESV alleviated proteinuria of diabetic mice, decreased malondialdehyde content while increased Mn-SOD activity in renal cortex, inhibited the apoptosis of glomerular podocytes and renal tubular epithelial cells, ameliorated pathological manifestations, and restored the expression of SIRT1 and PGC-1α in renal tissues of DN mice. In podocytes exposed to high glucose, RESV inhibited excessive ROS production and apoptosis. In addition, RESV decreased mitochondrial ROS production, improved respiratory chain complex I and III activity, elevated mitochondrial membrane potential, and inhibited the release of Cyto C and Diablo in the mitochondria into the cytoplasm. Taken together, our findings suggest that RESV ameliorates podocyte damage in diabetic mice via SIRT1/PGC-1α mediated attenuation of mitochondrial oxidative stress.

Let k, d (2d ≤ k) be two positive integers. We generalize the well studied notions of (k, d)-colorings and of the circular chromatic number χ c to signed graphs. This implies a new notion of colorings of signed graphs, and the corresponding chromatic number χ.Some basic facts on circular colorings of signed graphs and on the circular chromatic number are proved, and differences to the results on unsigned graphs are analyzed. In particular, we show that the difference between the circular chromatic number and the chromatic number of a signed graph is at most 1. Indeed, there are signed graphs where the difference is 1. On the other hand, for a signed graph on n vertices, if the difference is smaller than 1, then there exists n > 0, such that the difference is at most 1 − n .We also show that notion of (k, d)-colorings is equivalent to r-colorings (see [10]

This paper studies the choosability of signed planar graphs. We prove that every signed planar graph is 5-choosable and that there is a signed planar graph which is not 4-choosable while the unsigned graph is 4-choosable. For each k ∈ {3, 4, 5, 6}, every signed planar graph without circuits of length k is 4-choosable. Furthermore, every signed planar graph without circuits of length 3 and of length 4 is 3-choosable. We construct a signed planar graph with girth 4 which is not 3-choosable but the unsigned graph is 3-choosable.

The chromatic number χ((G, σ)) of a signed graph (G, σ) is the smallest number k for which there is a function c : V (G) → Z k such that c(v) = σ(e)c(w) for every edge e = vw. Let Σ(G) be the set of all signatures of G. We study the chromatic spectrumWe also prove some basic facts for critical graphs.Analogous results are obtained for a notion of vertex-coloring of signed graphs which was introduced by Máčajová, Raspaud, andŠkoviera in [2].