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

20 papers

math.CO2026

Positive Square Energy of Graphs with Minimum Degree at Least Two

S. Akbari, Fu-Tao Hu, Ya-Yang Liu

Let $s^{+} (G)$ denote the sum of the squares of the positive adjacency eigenvalues of a graph $G$ . The square-energy conjecture of Elphick, Farber, Goldberg, and Wocjan, proved by Li…

math.CO2026

Positive and Negative Square Energies of $2$ -Connected Graphs

S. Akbari, Fu-Tao Hu, Ya-Yang Liu

Let $G$ be a graph of order $n$ , and let $s^{+} (G)$ and $s^{-} (G)$ denote the sums of the squares of the positive and negative adjacency eigenvalues of $G$ , respectively. Recently, Liu…

math.CO2026

From the Square-Energy Conjecture to Signed Graphs: Sharp Bounds for Positive Square Energy

Fu-Tao Hu, Xiao Han

Let $Σ = (G, σ)$ be a connected signed graph of order $n$ and size $m$ , and let $s^{+} (Σ)$ and $s^{-} (Σ)$ denote the sums of the squares of its positive and negative adjacency eigenva…

math.CO2026

Extremal graphs for a conjecture on the square energy of graphs

Fu-Tao Hu, Ya-Yang Liu, Yi Wang

For a graph $G$ , let $s^{+} (G)$ and $s^{-} (G)$ denote the sums of the squares of its positive and negative adjacency eigenvalues. We determine all equality cases in the conjecture of E…

math.CO2024

Spectral Methods for Matrix Product Factorization

Saieed Akbari, Yi-Zheng Fan, Fu-Tao Hu +2

A graph $G$ is factored into graphs $H$ and $K$ via a matrix product if there exist adjacency matrices $A$ , $B$ , and $C$ of $G$ , $H$ , and $K$ , respectively, such that $A = B C$ . In…

math.CO2023

On extremal spectral radius of blow-up uniform hypergraphs

Shao-Han Xu, Fu-Tao Hu, Yi Wang

Let $G$ be an $r$ -uniform hypergraph of order $t$ and $ρ (G)$ is the spectral radius of $A (G)$ , where $A (G)$ is the adjacency tensor of $G$ . A blow-up of $G$ res…

math.CO2022

Spectra of weighted uniform hypertrees

Jiang-Chao Wan, Yi Wang, Fu-Tao Hu

Let $T$ be a $k$ -tree equipped with a weighting function $\w: V(T)\cup E(T)\rightarrow \C$, where $k \geq 3$ . The weighted matching polynomial of the weighted $k$ -tree $(T,\w)$ is…

math.CO2017

Maximum Independent Sets Partition of (n,k)-Star Graphs

Fu-Tao Hu

The (n,k)-star graph is a very important computer modelling. The independent number and chromatic number of a graph are two important parameters in graph theory. However, we did no…

math.CO2015

Resistance distances in corona and neighborhood corona graphs with Laplacian generalized inverse approach

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

Let $G_{1}$ and $G_{2}$ be two graphs on disjoint sets of $n_{1}$ and $n_{2}$ vertices, respectively. The corona of graphs $G_{1}$ and $G_{2}$ , denoted by $G_{1} \circ G_{2}$ , is the graph formed f…

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…

math.CO2012★ 1 cited

On the diameter of the Kronecker product graph

Fu-Tao Hu, Jun-Ming Xu

Let $G_{1}$ and $G_{2}$ be two undirected nontrivial graphs. The Kronecker product of $G_{1}$ and $G_{2}$ denoted by $G_{1} \otimes G_{2}$ with vertex set $V (G_{1}) \times V (G_{2})$ , two vertices $x…

math.CO2012★ 1 cited

On the p-reinforcement and the complexity

You Lu, Fu-Tao Hu, Jun-Ming Xu

Let $G = (V, E)$ be a graph and $p$ be a positive integer. A subset $S \subseteq V$ is called a $p$ -dominating set if each vertex not in $S$ has at least $p$ neighbors in $S$ . The $p$ -…

math.CO2011★ 4 cited

Roman Bondage Numbers of Some Graphs

Fu-Tao Hu, Ju-Ming Xu

A Roman dominating function on a graph $G = (V, E)$ is a function $f : V \to {0, 1, 2}$ satisfying the condition that every vertex $u$ with $f (u) = 0$ is adjacent to at least one vertex $…

math.CO2011★ 1 cited

The bondage number of $(n - 3)$ -regular graphs of order $n$

Fu-Tao Hu, Jun-Ming Xu

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$ is the smallest cardin…

math.CO2011

The total bondage number of grid graphs

Fu-Tao Hu, You Lu, Jun-Ming Xu

The total domination number of a graph $G$ without isolated vertices is the minimum number of vertices that dominate all vertices in $G$ . The total bondage number $b_{t} (G)$ of $G$ i…

math.CO2011

Total and paired domination numbers of toroidal meshes

Fu-Tao Hu, Jun-Ming Xu

Let $G$ be a graph without isolated vertices. The total domination number of $G$ is the minimum number of vertices that can dominate all vertices in $G$ , and the paired domination…

math.CO2011★ 3 cited

The Bondage Number of Mesh Networks

Fu-Tao Hu, Yong-Chang Cao, Jun-Ming Xu

The bondage number $b (G)$ of a nonempty graph $G$ is the smallest number of edges whose removal from $G$ results in a graph with domination number greater than that of $G$ . Denote…

math.CO2011★ 6 cited

Complexity of Bondage and Reinforcement

Fu-Tao Hu, Jun-Ming Xu

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$ . A dominating set $D$ is called a total dominating s…

Positive Square Energy of Graphs with Minimum Degree at Least Two

Positive and Negative Square Energies of 2-Connected Graphs

From the Square-Energy Conjecture to Signed Graphs: Sharp Bounds for Positive Square Energy

Extremal graphs for a conjecture on the square energy of graphs

Spectral Methods for Matrix Product Factorization

On extremal spectral radius of blow-up uniform hypergraphs

Spectra of weighted uniform hypertrees

Maximum Independent Sets Partition of (n,k)-Star Graphs

Resistance distances in corona and neighborhood corona graphs with Laplacian generalized inverse approach

The Laplacian polynomial of graphs derived from regular graphs and applications

Asymptotic Laplacian-Energy-Like Invariant of Lattices

The Algorithmic Complexity of Bondage and Reinforcement Problems in bipartite graphs

On the diameter of the Kronecker product graph

On the p-reinforcement and the complexity

Roman Bondage Numbers of Some Graphs

The bondage number of (n−3)-regular graphs of order n

The total bondage number of grid graphs

Total and paired domination numbers of toroidal meshes

The Bondage Number of Mesh Networks

Complexity of Bondage and Reinforcement

Positive and Negative Square Energies of $2$ -Connected Graphs

The bondage number of $(n - 3)$ -regular graphs of order $n$