Jiawen Deng

Xinjiang University of Finance and Economics

*This is an algorithmically generated author record based on publicly available information.

See Latest Publications

See Most Cited Publications

SciProfiles

Google Scholar

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Xinjiang University of Finance and Economics

Research Subjects

Research Interests

Jiawen Deng has a total of 5 co-authors. Here are the top co-authors by number of shared publications:

Guodong Li
Guangxi Colleges and Universities Key Laboratory of Data Analysis and Computation, School of Mathematics and Computing Science, Guilin University of Electronic Technology, Guilin 541004, China
1 shared publication
Jinfeng Zhang
School of Marxism, Changji University, Changji 831100, China
1 shared publication
Liyan Hua
Guangxi Colleges and Universities Key Laboratory of Data Analysis and Computation, School of Mathematics and Computing Science, Guilin University of Electronic Technology, Guilin 541004, China
1 shared publication
Shuo Li
School of Statistics and Data Science, Xinjiang University of Finance and Economics, Urumqi 830012, China
1 shared publication
Xu Chen
School of Statistics and Data Science, Xinjiang University of Finance and Economics, Urumqi 830012, China
1 shared publication

Latest Publications

Sort by

Open Access
Website
Google Scholar
- 29 July 2026
- Published by MDPI AG in Mathematics
The Least Distance Eigenvalue of Complement Graphs with Two Pendant Vertices
by Jinfeng Zhang, Xu Chen, Jiawen Deng, Shuo Li, Guodong Li, Liyan Hua
Let G be a connected simple graph with the vertex set $V (G) = {v_{1}, v_{2}, \dots, v_{n}}$ , where the distance $d_{G} (v_{i}, v_{j})$ is the length of a shortest path between $v_{i}$ and $v_{j}$ , and the distance matrix $D (G) = (d_{i j}) n \times n$ is defined by $d_{i j} = d_{G} (v_{i}, v_{j})$ . Being real symmetric and non-negative, $D (G)$ has real eigenvalues $λ_{1} (G) \geq λ_{2} (G) \geq \dots \geq λ_{n} (G)$ , with $λ_{n} (G)$ referred to as the least distance eigenvalue of G. In this paper, we give the maximum value of the least distance eigenvalue, and determine the unique extremal graph with two pendant vertices whose complements attain the value.
Website
Google Scholar
- 29 July 2026
- Published by MDPI AG in Mathematics
Open Access
The Least Distance Eigenvalue of Complement Graphs with Two Pendant Vertices
by Jinfeng Zhang, Xu Chen, Jiawen Deng, Shuo Li, Guodong Li, Liyan Hua
Let G be a connected simple graph with the vertex set $V (G) = {v_{1}, v_{2}, \dots, v_{n}}$ , where the distance $d_{G} (v_{i}, v_{j})$ is the length of a shortest path between $v_{i}$ and $v_{j}$ , and the distance matrix $D (G) = (d_{i j}) n \times n$ is defined by $d_{i j} = d_{G} (v_{i}, v_{j})$ . Being real symmetric and non-negative, $D (G)$ has real eigenvalues $λ_{1} (G) \geq λ_{2} (G) \geq \dots \geq λ_{n} (G)$ , with $λ_{n} (G)$ referred to as the least distance eigenvalue of G. In this paper, we give the maximum value of the least distance eigenvalue, and determine the unique extremal graph with two pendant vertices whose complements attain the value.

Jiawen Deng

Current Organizations / Institutes

Research Subjects

Research Interests

Jiawen Deng has a total of 5 co-authors. Here are the top co-authors by number of shared publications:

Latest Publications

The Least Distance Eigenvalue of Complement Graphs with Two Pendant Vertices

The Least Distance Eigenvalue of Complement Graphs with Two Pendant Vertices