The following pages link to Yaokun Wu (Q233542):
Displaying 48 items.
- Average range of Lipschitz functions on trees (Q509091) (← links)
- Strongly connected multivariate digraphs (Q521369) (← links)
- Hyperbolicity and chordality of a graph (Q540017) (← links)
- Lit-only \(\sigma \)-game on pseudo-trees (Q608278) (← links)
- Minimum light numbers in the \(\sigma \)-game and lit-only \(\sigma \)-game on unicyclic and grid graphs (Q648407) (← links)
- Hoffman polynomials of nonnegative irreducible matrices and strongly connected digraphs (Q819766) (← links)
- Even poset and a parity result for binary linear code (Q855546) (← links)
- Characteristic polynomials of ramified uniform covering digraphs (Q875047) (← links)
- Homomorphisms, representations and characteristic polynomials of digraphs (Q880045) (← links)
- Lifespan in a primitive Boolean linear dynamical system (Q907226) (← links)
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers (Q968201) (← links)
- Minimum light number of lit-only \(\sigma\)-game on a tree (Q995589) (← links)
- Recognizing edge clique graphs among interval graphs and probe interval graphs (Q998556) (← links)
- Two minimal forbidden subgraphs for double competition graphs of posets of dimension at most two (Q1023063) (← links)
- Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game? (Q1024268) (← links)
- On the matrix equation \(A^k=J-I\) (Q1124912) (← links)
- On the matrix equation \(A^l+A^{l+k}=J_n\) (Q1307521) (← links)
- \(g\)-circulant solutions to the (0,1) matrix equation \(A^m=J_n\) (Q1347955) (← links)
- An approach to solving \(A^{k}=J-I\) (Q1414133) (← links)
- Reconstructing unrooted phylogenetic trees from symbolic ternary metrics (Q1670475) (← links)
- Spectra and elementary cycles of the digraphs with unique paths of fixed length (Q1963932) (← links)
- Competition numbers and phylogeny numbers: uniform complete multipartite graphs (Q2000559) (← links)
- Phylogeny numbers of generalized Hamming graphs (Q2082421) (← links)
- Submodular functions and rooted trees (Q2095463) (← links)
- Cyclic arrangements with minimum modulo \(m\) winding numbers (Q2117515) (← links)
- A five-element transformation monoid on labelled trees (Q2311382) (← links)
- Invariant subspace, determinant and characteristic polynomials (Q2477549) (← links)
- Lit-only sigma game on a line graph (Q2519798) (← links)
- De Bruijn digraphs and affine transformations (Q2567205) (← links)
- Characteristic polynomials of digraphs having a semi-free action (Q2568368) (← links)
- An Expansion Property of Boolean Linear Maps (Q2813065) (← links)
- (Q2827796) (← links)
- Phylogenetic analysis and homology (Q2890540) (← links)
- A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs (Q2960472) (← links)
- (Q3166845) (← links)
- (Q3166906) (← links)
- (Q3374976) (← links)
- (Q3428192) (← links)
- (Q3575460) (← links)
- Maximal Neighborhood Search and Rigid Interval Graphs (Q4925308) (← links)
- Top-heavy phenomena for transformations (Q5037928) (← links)
- Weighted Rooted Trees: Fat or Tall? (Q5042262) (← links)
- (Q5167721) (← links)
- Primitivity and Hurwitz Primitivity of Nonnegative Matrix Tuples: A Unified Approach (Q5885810) (← links)
- Three conjectures of Ostrander on digraph Laplacian eigenvectors (Q5888904) (← links)
- The underlying line digraph structure of some (0, 1)-matrix equations (Q5957359) (← links)
- Correction to: ``Submodular functions and rooted trees'' (Q6038710) (← links)
- Inclusion matrices for rainbow subsets (Q6185748) (← links)
