4 citations · 7 across the 3 of their papers we have counts for
3 papers
math.CO2015★ 3 cited
The minimum size of graphs with given rainbow index
Thomas Y. H. Liu
The concept of -rainbow index of a connected graph , introduced by Chartrand, Okamoto and Zhang, is a natural generalization of the rainbow connection number. Let $…
math.CO2014
Maximally connected and super arc-connected Bi-Cayley digraphs
Yuhu Liu, Jixiang Meng
Let X=(V, E) be a digraph. X is maximally connected, if κ(X)=δ(X). X is maximally arc-connected, if λ(X)=δ(X). And X is super arc-connected, if every minimum arc-cut of X is either…
math.CO2013★ 4 cited
s-Inversion Sequences and P-Partitions of Type B
William Y. C. Chen, Alan J. X. Guo, Peter L. Guo +2
Given a sequence of positive integers, the inversion sequences with respect to , or -inversion sequences, were introduced by Savage and Schuster in their…