Yaoping Hou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Yaoping Hou has a total of 43 co-authors. Here are the top co-authors by number of shared publications:
Dijian Wang
15 shared publicationsDeqiong Li
College of Science, Hunan University of Technology and Business, Changsha, Hunan, People's Republic of China
13 shared publicationsQian Yu
Hunan Normal University
5 shared publications- Xiaodan Chen
School of Mathematics & Center for Applied Mathematics of Guangxi, Guangxi University, Nanning, China
3 shared publications - Chuan-Ming She
Center for Pure Mathematics, School of Mathematical Sciences, Anhui University, Hefei, China
2 shared publications - Deqiong Li
College of Science Hunan University of Technology and Business 410205 Changsha Hunan China
2 shared publications
Latest Publications
- 22 June 2026
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 393, 25-37
A complete characterization of non-bipartite graphs with all but two eigenvalues equal to ±1 and 0
- 22 June 2026
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 393, 25-37
A complete characterization of non-bipartite graphs with all but two eigenvalues equal to ±1 and 0
- 30 May 2026
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 74 (9) , 1175-1190
The constructions of strongly regular signed graphs by signed Cayley graphs
1. Let G be a simple connected graph with vertex set V(G) and edge set E(G). A signed graph G˙=(G,σ) consists of the underlying graph G and a sign function σ:E(G)→{+1,−1}. The adjacency matrix of G...
- 30 May 2026
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 74 (9) , 1175-1190
The constructions of strongly regular signed graphs by signed Cayley graphs
1. Let G be a simple connected graph with vertex set V(G) and edge set E(G). A signed graph G˙=(G,σ) consists of the underlying graph G and a sign function σ:E(G)→{+1,−1}. The adjacency matrix of G...
- 5 May 2026
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 744, 153-178
The net-regular strongly regular signed graphs with degree 6
- 5 May 2026
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 744, 153-178
The net-regular strongly regular signed graphs with degree 6
- 17 March 2026
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 45 (7) , 311
Maximum spread of $K_r-E(\cup _{i=1}^{\ell } P_{k_i})$-minor-free graphs- 17 March 2026
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 45 (7) , 311
Maximum spread of $K_r-E(\cup _{i=1}^{\ell } P_{k_i})$-minor-free graphs- Open Access
- 31 December 2025
- Published by American Journal of Combinatorics in American Journal of Combinatorics
- Vol. 4
The \(\mathscr{G}\)-average of adjacency and Laplacian polynomials of a graphLet \(\mathscr{G}\) be a finite multiplicative group of quaternion unit \(U(\mathbb{H})\). The \(\mathscr{G}\)-average of adjacency (resp., Laplacian) polynomial of a graph \(G\) is defined as the arithmetic mean of the characteristic polynomials of adjacency (resp., Laplacian) matrice of all \(\mathscr{G}\)-gain graphs on \(G\). In this paper, we prove that the \(\mathscr{G}\)-average adjacency (resp., Laplacian) polynomial of a graph for any non-trivial finite subgroup \(\mathscr{G}\) of \(U(\mathbb{H})\) coincides with its matching (resp., weighted TU-subgraph) polynomial, which generalizes previous findings for signed graphs.- 31 December 2025
- Published by American Journal of Combinatorics in American Journal of Combinatorics
- Vol. 4
Open AccessThe \(\mathscr{G}\)-average of adjacency and Laplacian polynomials of a graphLet \(\mathscr{G}\) be a finite multiplicative group of quaternion unit \(U(\mathbb{H})\). The \(\mathscr{G}\)-average of adjacency (resp., Laplacian) polynomial of a graph \(G\) is defined as the arithmetic mean of the characteristic polynomials of adjacency (resp., Laplacian) matrice of all \(\mathscr{G}\)-gain graphs on \(G\). In this paper, we prove that the \(\mathscr{G}\)-average adjacency (resp., Laplacian) polynomial of a graph for any non-trivial finite subgroup \(\mathscr{G}\) of \(U(\mathbb{H})\) coincides with its matching (resp., weighted TU-subgraph) polynomial, which generalizes previous findings for signed graphs. - 3 November 2025
- Published by Elsevier in Discrete Mathematics
- Vol. 349 (3)
On the maximal index of unbalanced signed graphs with a prescribed number of edges
- 3 November 2025
- Published by Elsevier in Discrete Mathematics
- Vol. 349 (3)
On the maximal index of unbalanced signed graphs with a prescribed number of edges
- Open Access
The net-regular strongly regular signed graphs with degree 6
In this paper, we study the net-regular strongly regular signed graphs with degree 6 and determine all connected 6-regular and net-regular strongly regular signed graphs. There are three, six and four 6-regular strongly regular signed graphs with net-degree 4, 2 and 0, respectively.
Open AccessThe net-regular strongly regular signed graphs with degree 6
In this paper, we study the net-regular strongly regular signed graphs with degree 6 and determine all connected 6-regular and net-regular strongly regular signed graphs. There are three, six and four 6-regular strongly regular signed graphs with net-degree 4, 2 and 0, respectively.
- Open Access
The net-regular strongly regular signed graphs with degree 5
In this paper, we determine all connected net-regular strongly regular signed graphs with degree 5. There are five and two strongly regular signed graphs with net-degree 3 and 1, respectively.
Open AccessThe net-regular strongly regular signed graphs with degree 5
In this paper, we determine all connected net-regular strongly regular signed graphs with degree 5. There are five and two strongly regular signed graphs with net-degree 3 and 1, respectively.
- 30 May 2025
- Published by Springer Nature in Acta Mathematicae Applicatae Sinica, English Series
- Vol. 42 (3) , 1-9
Linear Spectral Turán Problems for Expansions of Graphs with Given Chromatic Number
- 30 May 2025
- Published by Springer Nature in Acta Mathematicae Applicatae Sinica, English Series
- Vol. 42 (3) , 1-9
Linear Spectral Turán Problems for Expansions of Graphs with Given Chromatic Number
- 26 November 2024
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 362, 157-166
Turán problem of signed graph for negative odd cycle
- 26 November 2024
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 362, 157-166
Turán problem of signed graph for negative odd cycle