#### Filter Results:

#### Publication Year

2008

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Changjiang Bu, Jiemei Zhao, Jiapei Tang
- Applied Mathematics and Computation
- 2011

- Changjiang Bu, Jiemei Zhao, Jinshan Zheng
- Applied Mathematics and Computation
- 2008

- Jiang Zhou, Changjiang Bu
- Discrete Mathematics
- 2012

- Changjiang Bu, Min Li, Kuize Zhang, Lan Zheng
- Applied Mathematics and Computation
- 2009

In this paper, necessary and sufficient conditions are given for the existence of the group inverse of the block matrix A A B 0 ¡ over any skew field, where A, B are both square and rank(B) ≥ rank(A). The representation of this group inverse and some relative additive results are also given.

- Xiaogang Liu, Jiang Zhou, Changjiang Bu
- Discrete Applied Mathematics
- 2015

- Jiang Zhou, Changjiang Bu, Jihong Shen
- Electr. J. Comb.
- 2011

Let G be a graph with adjacency matrix A, let H(t) = exp(itA). G is called a periodic graph if there exists a time τ such that H(τ) is diagonal. If u and v are distinct vertices in G, we say that perfect state transfer occurs from u to v if there exists a time τ such that |H(τ) u,v | = 1. A necessary and sufficient condition for G is periodic is given. We… (More)

- Changjiang Bu, Chengcheng Feng, Shuyan Bai
- Applied Mathematics and Computation
- 2012

- JIEMEI ZHAO, CHANGJIANG BU
- 2010

Let K be a skew field and K n×n be the set of all n × n matrices over K. The purpose of this paper is to give some necessary and sufficient conditions for the existence and the representations of the group inverse of the block matrix A C B D under some conditions.

- Jiang Zhou, Zhongyu Wang, Changjiang Bu
- Electr. J. Comb.
- 2016

Let G be a connected graph of order n. The resistance matrix of G is defined as R G = (r ij (G)) n×n , where r ij (G) is the resistance distance between two vertices i and j in G. Eigenvalues of R G are called R-eigenvalues of G. If all row sums of R G are equal, then G is called resistance-regular. For any connected graph G, we show that R G determines the… (More)