Showing papers by "Huiqiu Lin published in 2016"
TL;DR: In this paper, the authors characterized all graphs with ∂ n (G ) = n − 2 and ∂ 2 ( G ) ∈ [n − 2, n ] when n ≥ 11.
19 citations
TL;DR: Lower bounds are given on $\ partial_n+\rho$ and $\partial_1-\ rho$ when $G
cong K_n$ and the extremal graphs are characterized.
18 citations
TL;DR: For a given nonnegative integer k, when n is sufficiently large with respect to k, Lin et al. as discussed by the authors showed that λ n − k (D ) ≤ − 1.
15 citations
TL;DR: TheDigraphs that have the minimum and second minimum spectral radius among all strongly connected digraphs with given order and dichromatic number are determined.
7 citations
TL;DR: The maximum and minimum sizes of digraphs with a given clique numbers as well as thedigraphs that attain these extremal sizes are determined.
Abstract: We determine the maximum and minimum sizes of digraphs with a given clique numbers as well as the digraphs that attain these extremal sizes. The maximum and minimum transmissions of connected digraphs with given clique numbers are also determined.
3 citations
TL;DR: The maximum sizes of strong digraphs under the constraint that their some parameters are fixed, such as vertex connectivity, edge-connectivity, the number of cut vertices are determined and Nordhaus–Gaddum type theorem for the diameter is established.
Abstract: In this paper, we determine the maximum sizes of strong digraphs under the constraint that their some parameters are fixed, such as vertex connectivity, edge-connectivity, the number of cut vertices. The corresponding extremal digraphs are also characterized. In addition, we establish Nordhaus---Gaddum type theorem for the diameter when $$\overrightarrow{K_n}$$Knź decomposing into many parts. We also pose a related conjecture for Wiener index of digraphs.
1 citations