Search Results - "Ma, Yingbin"

(Strong) Total proper connection of some digraphs by Ma, Yingbin, Nie, Kairui

“…The total proper connection number of a given digraph D , represented by tpc → ( D ) , denotes the smallest number of colors needed for making D total proper…”
Get full text

Some results on the total proper k-connection number by Ma, Yingbin, Zhang, Hui

“…In this paper, we first investigate the total proper connection number of a graph according to some constraints of . Next, we investigate the total proper…”
Get full text

Some Results on the 3-Vertex-Rainbow Index of a Graph by Ma, Yingbin, Zhu, Wenhan

“…Let G be a nontrivial connected graph with a vertex-coloring c : V ( G ) → { 1 , 2 , … , q } , q ∈ N . For a set S ⊆ V ( G ) and | S | ≥ 2 , a subtree T of G…”
Get full text

(Strong) Proper Connection in Some Digraphs by Ma, Yingbin, Nie, Kairui

“…An arc-colored digraph <inline-formula> <tex-math notation="LaTeX">D </tex-math></inline-formula> is proper connected if any pair of vertices <inline-formula>…”
Get full text

Graphs with Strong Proper Connection Numbers and Large Cliques by Ma, Yingbin, Zhang, Xiaoxue, Xue, Yanfeng

“…In this paper, we mainly investigate graphs with a small (strong) proper connection number and a large clique number. First, we discuss the (strong) proper…”
Get full text

Total Rainbow Connection Number of Some Graph Operations by Li, Hengzhe, Ma, Yingbin, Zhao, Yan

“…In a graph H with a total coloring, a path Q is a total rainbow if all elements in V(Q)∪E(Q), except for its end vertices, are assigned different colors. The…”
Get full text

The Vertex-Rainbow Connection Number of Some Graph Operations by Li, Hengzhe, Ma, Yingbin, Li, Xueliang

“…A path in an edge-colored (respectively vertex-colored) graph is (respectively ) if no two edges (respectively internal vertices) of the path are colored the…”
Get full text

Disjoint hypercyclicity equals disjoint supercyclicity for families of Taylor-type operators by Ma, Yingbin, Wang, Cui

“…We characterize disjointness of supercyclic operators which map a holomorphic function to a partial sum of the Taylor expansion. In particular, we show that…”
Get full text

Hardness Results for Total Rainbow Connection of Graphs by Chen, Lily, Huo, Bofeng, Ma, Yingbin

“…A total-colored path is total rainbow if both its edges and internal vertices have distinct colors. The total rainbow connection number of a connected graph G,…”
Get full text

Graphs with vertex rainbow connection number two by Lu, ZaiPing, Ma, YingBin

“…An edge colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a…”
Get full text

Graphs with (strong) proper connection numbers m−3 and m−4 by Ma, Yingbin, Zhang, Xiaoxue

“…•Characterize all graphs with strong proper connection number m−3.•Present all graphs satisfying proper connection number or strong proper connection number…”
Get full text

Some results on the 3‐total‐rainbow index by Ma, Yingbin, Zhu, Wenhan

“…•Determine the 3-total-rainbow index of Cn.•Investigate the 3-total-rainbow index of unicyclic graphs.•Provide a sharp upper bound for the 3-total-rainbow…”
Get full text

Rainbow connection numbers of Cayley digraphs on abelian groups by Ma, Yingbin, Lu, Zaiping

“…A directed path in an edge colored digraph is said to be a rainbow path if no two edges on this path share the same color. An edge colored digraph Γ is rainbow…”
Get full text

Total Rainbow Connection Number and Complementary Graph by Ma, Yingbin

“…A vertex-colored graph G is rainbow vertex connected if any two distinct vertices are connected by a path whose internal vertices have distinct colors. The…”
Get full text

Rainbow connection number and graph operations by Li, Hengzhe, Ma, Yingbin

“…A path in an edge-colored graph G is rainbow if no two edges of the path are colored the same. An edge-colored graph G is rainbow connected if every two…”
Get full text

(Strong) Proper vertex connection of some digraphs by Nie, Kairui, Ma, Yingbin, Sidorowicz, Elżbieta

“…The (strong) proper vertex connection number spvc→(Γ), (s)pvc-number for short, is denoted as the smallest cardinality of colors required to color the digraph…”
Get full text

Some results on (strong) total proper connection number of some digraphs by Ma, Yingbin, Wang, Mingli, Zhao, Wei, Nie, Kairui

“…In this paper, we present the total proper connection number of strong k-quasi-transitive digraphs with diam(D)≥k+2 for even k. Next, we determine the exact…”
Get full text

Rainbow connection numbers of Cayley graphs by Ma, Yingbin, Lu, Zaiping

“…An edge colored graph is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number, rc…”
Get full text

The generalized 3-connectivity of graph products by Li, Hengzhe, Ma, Yingbin, Yang, Weihua, Wang, Yifei

“…The generalized k-connectivity κk(G) of a graph G, which was introduced by Chartrand et al. (1984), is a generalization of the concept of vertex connectivity…”
Get full text

Graphs with small total rainbow connection number by Ma, Yingbin, Chen, Lily, Li, Hengzhe

“…Abstract A total-colored path is total rainbow if its edges and internal vertices have distinct colors. A total-colored graph G is total rainbow connected if…”
Get full text