• Publications
• Influence
Extraconnectivity of hypercubes
• Mathematics, Computer Science
• Appl. Math. Lett.
• 1 June 2009
The g-extraconnectivity of G is the minimum cardinality of a set of vertices of G , if it exists, whose deletion disconnects G , and where every remaining component has more than g vertices. Expand
• 76
• 6
Edge fault tolerance of graphs with respect to super edge connectivity
• Computer Science, Mathematics
• Discret. Appl. Math.
• 1 March 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. Expand
• 18
• 3
Domination in lexicographic product graphs
• Mathematics, Computer Science
• Ars Comb.
• 2011
• 14
• 3
On optimally-lambda(3) transitive graphs
• Computer Science, Mathematics
• Discret. Appl. Math.
• 15 April 2006
A graph X is said to be optimally-λ(3) if λ(i)(X) = ξi (X) (i = 1, 2, 3). Expand
• 10
• 2
Spectra of transformation digraphs of a regular digraph
• Mathematics
• 1 July 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 sevenExpand
• 4
• 2
On a kind of restricted edge connectivity of graphs
• Computer Science, Mathematics
• Discret. Appl. Math.
• 15 March 2002
We call a graph G super-λ(3) if λ (m) (G)=ξ m (G) (1⩽m ⩽3) . Expand
• 93
• 1
• PDF
Conditional connectivity of Cayley graphs generated by transposition trees
• Mathematics, Computer Science
• Inf. Process. Lett.
• 1 November 2010
We determine R"2-(edge)connectivity and 2-extra(edge)Connectivity of Cayley graphs generated by transposition trees. Expand
• 60
• 1
Connectivity of Vertex and Edge Transitive Graphs
• J. Meng
• Computer Science, Mathematics
• Discret. Appl. Math.
• 1 May 2003
A graph is said to be hyper-connected if every minimum vertex cut creates exactly two components, one of which is an isolated vertex. Expand
• 30
• 1
The restricted arc connectivity of Cartesian product digraphs
• Mathematics, Computer Science
• Inf. Process. Lett.
• 1 October 2009
We prove that Cartesian product digraph D=D"1xD"2 of two strongly connected digraphs D"1 is @l^'-connected. Expand
• 15
• 1
On the isomorphisms and automorphism groups of circulants
• Mathematics, Computer Science
• Graphs Comb.
• 1 June 1996
Cn(S) ≅ Cn(T) if and only if T = λS, where λ is an integer relatively prime to n. Expand
• 24
• 1