activity
20152020
most citedOn (strong) proper vertex-connection of graphs

2 citations · 6 across the 3 of their papers we have counts for

collaborators

10 papers

math.RT2020

Derived dimension via τ-tilting theory

Yingying Zhang

Comparing the bounded derived categories of an algebra and of the endomorphism algebra of a given support τ-tilting module, we find a relation between the derived dimensions of an…

math.DG20192 cited

Residue formula for an obstruction to Coupled Kähler-Einstein metrics

Akito Futaki, Yingying Zhang

We obtain a residue formula for an obstruction to the existence of coupled Kähler-Einstein metrics described by Futaki-Zhang. We apply it to an example studied separately by Futaki…

math.DG2018

Coupled Sasaki-Ricci solitons

Akito Futaki, Yingying Zhang

Motivated by the study of coupled Kähler-Einstein metrics by Hultgren and Witt Nyström and coupled Kähler-Ricci solitons by Hultgren, we study in this paper coupled Sasaki-Einstein…

math.DG2018

A Liouville-type theorem and Bochner formula for harmonic maps into metric spaces

Brian Freidin, Yingying Zhang

We study analytic properties of harmonic maps from Riemannian polyhedra into CAT() spaces for . Locally, on each top-dimensional face of the domain, this amounts to…

math.CO20172 cited

Conflict-free vertex-connections of graphs

Xueliang Li, Yingying Zhang, Xiaoyu Zhu +2

A path in a vertex-colored graph is called \emph{conflict free} if there is a color used on exactly one of its vertices. A vertex-colored graph is said to be \emph{conflict-free ve…

math.CO2017

Total proper connection and graph operations

Yingying Zhang, Xiaoyu Zhu

A graph is said to be {\it total-colored} if all the edges and vertices of the graph are colored. A path in a total-colored graph is a {\it total proper path} if any two adja…