Tianjin University

output

19982026

most citedConvergence of Edge Computing and Deep Learning: A Comprehensive Survey

1.5k citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing 2017 · math.COShow all

7 papers · 2 filters

math.CO2017★ 11 cited

Signless Laplacian spectral radius and Hamiltonicity of graphs with large minimum degree

Yawen Li, Yao liu, Xing Peng

In this paper, we establish a tight sufficient condition for the Hamiltonicity of graphs with large minimum degree in terms of the signless Laplacian spectral radius and characteri…

math.CO2017

A note on the 4-girth-thickness of K_{n,n,n}

Xia Guo, Yan Yang

The $4$ -girth-thickness $θ (4, G)$ of a graph $G$ is the minimum number of planar subgraphs of girth at least four whose union is $G$ . In this paper, we obtain that the 4-girth-thick…

math.CO2017★ 1 cited

An Ore-type Condition for Large $k$ -factor and Disjoint Perfect Matchings

Hongliang Lu, Bo Ning

Win [\emph{J. Graph Theory} {\bf 6}(1982), 489--492] conjectured that a graph $G$ on $n$ vertices contains $k$ disjoint perfect matchings, if the degree sum of any two nonadjacent…

math.CO2017★ 17 cited

Stability results on the circumference of a graph

Jie Ma, Bo Ning

In this paper, we extend and refine previous Turán-type results on graphs with a given circumference. Let $W_{n, k, c}$ be the graph obtained from a clique $K_{c - k + 1}$ by adding $n-(…

math.CO2017

The edit distance function of some graphs

Yumei Hu, Yongtang Shi, Yarong Wei

The edit distance function of a hereditary property $H$ is the asymptotically largest edit distance between a graph of density $p \in [0, 1]$ and $H$ . Denote by $P…

math.CO2017★ 19 cited

On sufficient conditions for rainbow cycles in edge-colored graphs

Shinya Fujita, Bo Ning, Chuandong Xu +1

Let $G$ be an edge-colored graph. We use $e (G)$ and $c (G)$ to denote the number of edges of $G$ and the number of colors appearing on $E (G)$ , respectively. For a vertex $v \in V (G)$ …

math.CO2017

Overpartitions Identities Involving Gaps and Weights

Jeremy J. F. Guo, Doris D. M. Sang, Diane Y. H. Shi

In this paper, we find an identity which connects the overpartition function and the function of Rogers--Ramanujan--Gordon type overpartitions by considering the weights and gaps.…

Signless Laplacian spectral radius and Hamiltonicity of graphs with large minimum degree

A note on the 4-girth-thickness of K_{n,n,n}

An Ore-type Condition for Large k-factor and Disjoint Perfect Matchings

Stability results on the circumference of a graph

The edit distance function of some graphs

On sufficient conditions for rainbow cycles in edge-colored graphs

Overpartitions Identities Involving Gaps and Weights

An Ore-type Condition for Large $k$ -factor and Disjoint Perfect Matchings