# Search results for: Yaping Mao

Discussiones Mathematicae Graph Theory > 2017 > 38 > 1 > 83-95

Applied Mathematics and Computation > 2017 > 308 > C > 1-10

_{k}(G) of a graph G, which is a generalization of Dirac’s notion, was introduced by Hager in 1986. It is natural to introduce the concept of path k-edge-connectivity ω

_{k}(G) of a graph G. Denote by G ○ H the lexicographic product of two graphs G and H. In this paper, we prove that ω3(G∘H)≥ω3(G)⌊3|V(H)|4⌋...

Virus Genes > 2017 > 53 > 6 > 876-882

Discrete Applied Mathematics > 2017 > 219 > C > 167-175

Bulletin of the Malaysian Mathematical Sciences Society > 2018 > 41 > 4 > 2041-2051

*P*in an edge-colored graph

*G*is called a

*proper path*if no two adjacent edges of

*P*are colored the same, and

*G*is

*proper connected*if every two vertices of

*G*are connected by a proper path in

*G*. The

*proper connection number*of a connected graph

*G*, denoted by

*pc*(

*G*), is the minimum number of colors that are needed to make

*G*proper connected. In this paper, we study the

*proper connection number*...

Veterinary Microbiology > 2017 > 199 > C > 8-14

Bulletin of the Malaysian Mathematical Sciences Society > 2018 > 41 > 4 > 2019-2027

*k*-connectivity $$\kappa _k(G)$$ κk(G) of a graph

*G*, introduced by Hager (J Comb Theory 38:179–189, 1985) is a generalization of the classical connectivity $$\kappa (G)$$ κ(G) with $$\kappa _2(G)=\kappa (G)$$ κ2(G)=κ(G) . In this paper, we construct graphs to show that for every pair of integers

*m*and $$n(1<n <m)$$ n(1<n<m) there is a graph with the generalized 3-connectivity...

Discussiones Mathematicae Graph Theory > 2016 > 36 > 4 > 931-958

Virus Research > 2016 > 222 > C > 24-28

Discussiones Mathematicae Graph Theory > 2016 > 36 > 3 > 669-681

Virus Research > 2016 > 217 > C > 76-84

Discussiones Mathematicae Graph Theory > 2016 > 36 > 2 > 455-465

Virus Genes > 2016 > 52 > 3 > 388-396

Virus Genes > 2016 > 52 > 4 > 463-473

Journal of Corporate Finance > 2015 > 35 > Complete > 43-61

Information Processing Letters > 2015 > 115 > 12 > 977-982

Journal of Combinatorial Optimization > 2017 > 33 > 1 > 275-282

*k*-connectivity $$\kappa _k(G)$$ κ k ( G ) of a graph

*G*was introduced by Chartrand et al. in (Bull Bombay Math Colloq 2:1–6, 1984), which is a nice generalization of the classical connectivity. Recently, as a natural counterpart, Li et al. proposed the concept of generalized edge-connectivity for a graph. In this paper, we consider the computational complexity of the...

Discrete Mathematics > 2015 > 338 > 5 > 669-673

Discrete Applied Mathematics > 2015 > 185 > Complete > 102-112