The following pages link to Liang-Hao Huang (Q389668):
Displaying 11 items.
- Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows (Q389670) (← links)
- A characterization of graphs with rank 5 (Q414705) (← links)
- A characterization of graphs with rank 4 (Q630525) (← links)
- On the rank of a cograph (Q929485) (← links)
- On minimum rank and zero forcing sets of a graph (Q967512) (← links)
- A note on universally optimal matrices and field independence of the minimum rank of a graph (Q977476) (← links)
- \(L(h,k)\)-labelings of Hamming graphs (Q1025475) (← links)
- On \(L(2,1)\)-labeling of generalized Petersen graphs (Q1928525) (← links)
- Some results on the target set selection problem (Q1956258) (← links)
- The linear guessing number of undirected graphs (Q2447965) (← links)
- Target Set Selection Problem for Honeycomb Networks (Q5300497) (← links)
