Fu-Tao Hu

activity

20112026

most citedComplexity of Bondage and Reinforcement

6 citations · 19 across the 20 of their papers we have counts for

collaborators

Showing 2014Show all

3 papers · 1 filter

math.CO2014★ 3 cited

The Laplacian polynomial of graphs derived from regular graphs and applications

Jia-Bao Liu, Xiang-Feng Pan, Fu-Tao Hu

Let $R (G)$ be the graph obtained from $G$ by adding a new vertex corresponding to each edge of $G$ and by joining each new vertex to the end vertices of the corresponding edge. Let…

math.CO2014

Asymptotic Laplacian-Energy-Like Invariant of Lattices

Jia-Bao Liu, Xiang-Feng Pan, Fu-Tao Hu +1

Let $μ_{1} \geq μ_{2} \geq \dots \geq μ_{n}$ denote the Laplacian eigenvalues of $G$ with $n$ vertices. The Laplacian-energy-like invariant, denoted by $L E L (G) = \sum_{i = 1}^{n - 1} μ_{i}$ , is…

math.CO2014

The Algorithmic Complexity of Bondage and Reinforcement Problems in bipartite graphs

Fu-Tao Hu, Moo Young Sohn

Let $G = (V, E)$ be a graph. A subset $D \subseteq V$ is a dominating set if every vertex not in $D$ is adjacent to a vertex in $D$ . The domination number of $G$ , denoted by $γ (G)$ , is…