11 citations · 11 across the 8 of their papers we have counts for
9 papers
Perturbation results for distance-edge-monitoring numbers
Chenxu Yang, Ralf Klasing, Changxiang He +1
Foucaud et al. recently introduced and initiated the study of a new graph-theoretic concept in the area of network monitoring. Given a graph , a set $M \subseteq V(…
Maximum principal ratio of the signless Laplacian of graphs
Lele Liu, Shengming Hu, Changxiang He
Let be a connected graph and be the signless Laplacian of . The principal ratio of is the ratio of the maximum and minimum entries of the Perron vector…
Some multivariable Rado numbers
Gang Yang, Yaping Mao, Changxiang He +1
The Rado number of an equation is a Ramsey-theoretic quantity associated to the equation. Let be a linear equation. Denote by the mi…
Revisiting the Maximum Principal Ratio of Graphs
Lele Liu, Changxiang He
Let be a connected graph, the principal ratio of is the ratio of the maximum and minimum entries of its Perron eigenvector. In 2007, Cioab\v a and Gregory conjectured that…
Some -spectral extremal results for some digraphs
Haiying Shan, Feifei Wang, Changxiang He
In this paper, we characterize the extremal digraphs with the maximal or minimal -spectral radius among some digraph classes such as rose digraphs, generalized theta digraphs an…
A proof of a conjecture on the distance spectral radius and maximum transmission of graphs
Lele Liu, Haiying Shan, Changxiang He
Let be a simple connected graph, and be the distance matrix of . Suppose that and are the maximum row sum and the spectral radius of , re…
On the index of unbalanced signed bicyclic graphs
Changxiang He, Yuying Li, Haiying Shan +1
In this paper, we focus on the index ( largest eigenvalue) of the adjacency matrix of connected signed graphs. We give some general results on the index when the corresponding sign…
The energy change of the complete multipartite graph
Hai-Ying Shan, Chang-Xiang He, Zhen-Sheng Yu
The energy of a graph is defined as the sum of the absolute values of all eigenvalues of the graph. Akbari et al. \cite{S. Akbari} proved that for a complete multipartite graph $K_…
Laplacian spectral characterization of roses
Changxiang He, Edwin R. van Dam
A rose graph is a graph consisting of cycles that all meet in one vertex. We show that except for two specific examples, these rose graphs are determined by the Laplacian spectrum,…