Guihai Yu

activity

20112021

most citedThe skew-rank of oriented graphs

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

collaborators

7 papers

math.CO2021★ 1 cited

On the computational complexity of the Steiner $k$ -eccentricity

Xingfu Li, Guihai Yu, Aleksandar Ilić +1

The Steiner $k$ -eccentricity of a vertex $v$ of a graph $G$ is the maximum Steiner distance over all $k$ -subsets of $V (G)$ which contain $v$ . A linear time algorithm for calculati…

math.CO2020★ 2 cited

The Steiner $k$ -eccentricity on trees

Xingfu Li, Guihai Yu, Sandi Klavžar +2

We study the Steiner $k$ -eccentricity on trees, which generalizes the previous one in the paper [X.~Li, G.~Yu, S.~Klavžar, On the average Steiner 3-eccentricity of trees, arXiv:200…

math.CO2020★ 1 cited

On the average Steiner 3-eccentricity of trees

Xingfu Li, Guihai Yu, Sandi Klavžar

The Steiner $k$ -eccentricity of a vertex $v$ of a graph $G$ is the maximum Steiner distance over all $k$ -subsets of $V (G)$ which contain $v$ . In this paper Steiner $3$ -eccentricity…

math.CO2014★ 3 cited

The skew-rank of oriented graphs

Xueliang Li, Guihai Yu

An oriented graph $G^{σ}$ is a digraph without loops and multiple arcs, where $G$ is called the underlying graph of $G^{σ}$ . Let $S (G^{σ})$ denote the skew-adjacency matrix of $G^{σ}$ . The…

math.CO2013

The inertia of weighted unicyclic graphs

Guihai Yu, Xiao-Dong Zhang, Lihua Feng

Let $G_{w}$ be a weighted graph. The \textit{inertia} of $G_{w}$ is the triple $I n (G_{w}) = (i_{+} (G_{w}), i_{-} (G_{w}),$ $i_{0} (G_{w}))$ , where $i_{+} (G_{w}), i_{-} (G_{w}), i_{0} (G_{w})$ are the number of…

math.CO2011

The largest $n - 1$ Hosoya indices of unicyclic graphs

Guihai Yu, Lihua Feng, Aleksandar Ilic

The Hosoya index $Z (G)$ of a graph $G$ is defined as the total number of edge independent sets of $G$ . In this paper, we extend the research of [J. Ou, On extremal unicyclic molec…

On the computational complexity of the Steiner k-eccentricity

The Steiner k-eccentricity on trees