The following pages link to Arbind Kumar Lal (Q659675):
Displaying 50 items.
- Algebraic connectivity of connected graphs with fixed number of pendant vertices (Q659677) (← links)
- A face of the polytope of doubly stochastic matrices associated with certain matrix expansions (Q677128) (← links)
- On the maximum of ergodicity coefficients, the Dobrushin ergodicity coefficient, and products of stochastic matrices (Q677130) (← links)
- Special classes of positive and completely positive maps (Q677813) (← links)
- (Q1014807) (redirect page) (← links)
- Laplacian spectrum of weakly quasi-threshold graphs (Q1014809) (← links)
- Path-positive graphs (Q1173951) (← links)
- On lower bounds for covering codes (Q1281409) (← links)
- Some results on NQR codes (Q1283214) (← links)
- (Q1300824) (redirect page) (← links)
- Idempotency of the Hermitian part of a complex matrix (Q1300825) (← links)
- On the product of orthogonal projectors (Q1300826) (← links)
- On semi-orthogonality and a special class of matrices (Q1300829) (← links)
- On some properties of \(\mathbf P\)-matrix sets (Q1300909) (← links)
- Path positivity and infinite Coxeter groups (Q1316184) (← links)
- Inequalities for the \(q\)-permanent (Q1319998) (← links)
- Matrix Vieta theorem revisited (Q1354893) (← links)
- Determinants of matrices of the conference type (Q1362671) (← links)
- On nonnegative matrices similar to positive matrices (Q1372980) (← links)
- A new statement about the theorem determining the region of eigenvalues of stochastic matrices (Q1373321) (← links)
- Majorization, polyhedra, and statistical testing problems (Q1379114) (← links)
- Maximising the permanent of \((0,1)\)-matrices and the number of extensions of Latin rectangles (Q1379135) (← links)
- A connection between positive semidefinite and Euclidean distance matrix completion problems (Q1381268) (← links)
- Hook immanantal inequalities for trees explained (Q1381277) (← links)
- On Tanner codes: Minimum distance and decoding (Q1566399) (← links)
- (Q1814738) (redirect page) (← links)
- On a conjecture about the strict Hall exponents of primitive matrices (Q1814739) (← links)
- On a subclass of \(P_ 0\) (Q1894500) (← links)
- The weight hierarchy of the Kasami codes (Q1901036) (← links)
- Rank decomposability in incident spaces (Q1904043) (← links)
- Completing a symmetric \(2\times 2\) block matrix and its inverse (Q1911934) (← links)
- Applications of minor-summation formula. I: Littlewood's formulas (Q1921905) (← links)
- Largest \(j\)-simplices in \(d\)-cubes: Some relatives of the Hadamard maximum determinant problem (Q1923163) (← links)
- A formula for all minors of the adjacency matrix and an application (Q2017199) (← links)
- Representation of cyclotomic fields and their subfields (Q2392873) (← links)
- The effect on the algebraic connectivity of a tree by grafting or collapsing of edges (Q2469512) (← links)
- A \(q\)-analogue of the distance matrix of a tree (Q2496651) (← links)
- A proof of MacWilliams' identity (Q2563498) (← links)
- On linear codes over \(\mathbb Z_2\) (Q2572966) (← links)
- On algebraic connectivity of graphs with at most two points of articulation in each block (Q2895688) (← links)
- The distance matrix of a bidirected tree (Q3394463) (← links)
- On trees with Laplacian eigenvalue one (Q3535382) (← links)
- (Q3635763) (← links)
- Zero-sum two-person semi-Markov games (Q3992286) (← links)
- On the generalized Hamming weights of cyclic codes (Q4336311) (← links)
- (Q4502624) (← links)
- (Q4502642) (← links)
- (Q4940036) (← links)
- Inequalities among two rowed immanants of the <i>q</i>-Laplacian of trees and odd height peaks in generalized Dyck paths (Q5067767) (← links)
- On Generalized Hamming Weights and the Covering Radius of Linear Codes (Q5386116) (← links)
