#### Filter Results:

- Full text PDF available (31)

#### Publication Year

1989

2019

- This year (9)
- Last 5 years (68)
- Last 10 years (120)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Weihua Yang, Jixiang Meng
- Appl. Math. Lett.
- 2009

Given a graph G and a non-negative integer g, the g-extraconnectivity of G (written κg(G)) is the minimum cardinality of a set of vertices of G, if it exists, whose deletion disconnects G, and where… (More)

- Jixiang Meng
- Discrete Applied Mathematics
- 2003

A graph is said to be super-connected if every minimum vertex cut isolates a vertex. A graph is said to be hyper-connected if each minimum vertex cut creates exactly two components, one of which is… (More)

- Zhao Zhang, Jixiang Meng
- Discrete Applied Mathematics
- 2006

Let X = (V, E) be a connected graph and S ⊆ E. S is said to be an m-restricted edge cut if X - S is disconnected and each component of X - S contains at least m vertices. Let λ(m) (X) be the minimum… (More)

- Jixiang Meng, Youhu Ji
- Discrete Applied Mathematics
- 2002

Abstract Let G =( V , E ) be a connected graph and S ⊂ E . S is said to be a m -restricted edge cut ( m -RC) if G − S is disconnected and each component contains at least m vertices. The m… (More)

- Yanmei Hong, Jixiang Meng, Zhao Zhang
- Discrete Applied Mathematics
- 2012

A connected graph G is super edge connected (super- λ for short) if every minimum edge cut of G is the set of edges incident with some vertex. We define a super- λ graph G to be m -super- λ if G - S… (More)

- Juan Liu, Jixiang Meng
- 2010

Let D = (V(D), A(D)) be a digraph, x, y, z be three variables taking values − or +, and D xyz denote the transformation digraphs of D. In this article, we determine the spectra of seven… (More)

- Weihua Yang, Hengzhe Li, Jixiang Meng
- Inf. Process. Lett.
- 2010

Given a graph G and a non-negative integer h, the R"h-(edge)connectivity of G is the minimum cardinality of a set of (edges)vertices of G, if any, whose deletion disconnects G, and every remaining… (More)

- Qiongxiang Huang, Jixiang Meng
- Graphs and Combinatorics
- 1996

AbstractDenote by Cn(S) the circulant graph (or digraph). Let M be a minimal generating element subset of Zn, the cyclic group of integers modulo n, and
$$\tilde M = \left\{ {\left. {m, - m}… (More)

- Yingzhi Tian, Jixiang Meng
- Discrete Mathematics
- 2010

Let X=(V,E) be a connected graph. Then X is called super restricted edge-connected, in short, [email protected]^', if every minimum edge set F of X such that X-F is disconnected and every component… (More)

- Zhao Zhang, Jixiang Meng
- Discrete Mathematics
- 2006

A graph G is said to be hyper-connected if the removal of every minimum cut creates exactly two connected components, one of which is an isolated vertex. In this paper, we first generalize the… (More)