The following pages link to Sudipta Mallik (Q252500):
Displaying 16 items.
- Integrally normalizable matrices with respect to a given set (Q269279) (← links)
- An analog of matrix tree theorem for signless Laplacians (Q1625479) (← links)
- Moore-Penrose inverses of the signless Laplacian and edge-Laplacian of graphs (Q2032877) (← links)
- Construction of real skew-symmetric matrices from interlaced spectral data, and graph (Q2261540) (← links)
- Classes of graphs with minimum skew rank 4 (Q2435566) (← links)
- On graphs of minimum skew rank 4 (Q2789421) (← links)
- (Q4990142) (← links)
- A new formula for the minimum distance of an expander code (Q5884135) (← links)
- Spectral characterization of matchings in graphs (Q5965406) (← links)
- The inverse of the incidence matrix of a unicyclic graph (Q6160514) (← links)
- Alternative Proofs on the Indices of Cacti and Unicyclic Graphs with $n$ Vertices (Q6228314) (← links)
- The maximum multiplicity of an eigenvalue of symmetric matrices with a given graph (Q6269198) (← links)
- A New Formula for the Minimum Distance of an Expander Code (Q6357586) (← links)
- Incidence and Laplacian matrices of wheel graphs and their inverses (Q6387731) (← links)
- Matrix tree theorem for the net Laplacian matrix of a signed graph (Q6413248) (← links)
- Signed graphs and inverses of their incidence matrices (Q6458138) (← links)