17 citations · 35 across the 19 of their papers we have counts for
19 papers
Nordhaus-Gaddum inequality for the spectral radius of a graph of order
Yen-Jen Cheng, Chih-wen Weng
We determine the extremal graph of order that maximizes the sum of the spectral radii of and its complement. This resolves a conjecture posed by Stevanović in 2007.
A matrix realization of spectral bounds
Yen-Jen Cheng, Chih-wen Weng
We give a unified and systematic way to find bounds for the largest real eigenvalue of a nonnegative matrix by considering its modified quotient matrix. We leverage this insight to…
Sharp bounds of the -spectral radii of mixed trees
Yen-Jen Cheng, Louis Kao, Chih-Wen Weng
A mixed tree is a tree in which both directed arcs and undirected edges may exist. Let be a mixed tree with vertices and arcs, where an undirected edge is counted twice…
Counterexamples of the Bhattacharya-Friedland-Peled conjecture
Yen-Jen Cheng, Chia-An Liu, Chih-wen Weng
The Brauldi-Hoffman conjecture, proved by Rowlinson in 1988, characterized the graph with maximal spectral radius among all simple graphs with prescribed number of edges. In 2008,…
The relation between Hamiltonian and -tough properties of the Cartesian product graphs
Louis Kao, Chih-wen Weng
The relation between Hamiltonicity and toughness of a graph is a long standing research problem. The paper studies the Hamiltonicity of the Cartesian product graph …
On the degree pairs of a graph
Yu-pei Huang, Chia-an Liu, Chih-wen Weng
Let G be a simple graph without isolated vertices. For a vertex i in G, the degree d_i is the number of vertices adjacent to i and the average 2-degree m_i is the mean of the degre…