Learn More

- Xu San-xing
- 2008

This article,by studying relations between the normal side-coloring and the total coloring of graph using some relative results about the normal side-coloring,presents several new results,and offers… (More)

- Xu San-xing
- 2006

Let G be a simple connected graph with n vertices and ρ be its spectral radius. Let G be the complement graph of G and ρ be the spectral radius of G . In this paper, the upper bound of the spectral… (More)

- Xu San-xing
- 2006

The theory of graph spectra is an important area in graph theory.G=(V,E)is a finite undirected graph without loops and multiple edges.A(G) and D(G)denotes the adjacency matrix and the diagonal matrix… (More)

- Xu San-xing
- 2009

The adjacent of Vertex-Distinguish Total Coloring is a total coloring and the sets of the colors of two adjiacent vertex-es are different.The definition of leaf-gragh is presented in the paper,and… (More)

- Xu San-xing
- 2007

This article discusses the maximum eigenvalue,the number of vertexes,and the relationship between the vertex numbers and the number of their sides,of the k cycle graphs of length 3.

- ‹
- 1
- ›