Home Teaching Research Personal Contact ☰

Research

Research Interests
Algebraic and Spectral Graph Theory, Coding Theory, Combinatorics, Linear Algebra, Graph Theory, Combinatorial Matrix Theory

Current Projects
I have been working on multiple problems involving signed graphs, eccentricity matrices, Moore-Penrose inverses, combinatorial codes etc. If you are interested to collaborate with me, please feel free to email me.

My talk at New York Combinatorics Seminar on March 22, 2024:

Publications

  1. Sudipta Mallik, An extension of determinant and its application to fractional perfect matchings of a graph. (under review)

  2. Sudipta Mallik and Bahattin Yildiz, Codes from incidence matrices of hypergraphs., arXiv:2201.06733. (under review)

  3. Abdullah Alazemi, Milica Andelic, and Sudipta Mallik, Signed graphs and inverses of their incidence matrices, Linear Algebra and its Applications 694 (2024) 78-100.

  4. Sudipta Mallik, Matrix tree theorem for the net Laplacian matrix of a signed graph Linear and Multilinear Algebra (2023) https://doi.org/10.1080/03081087.2023.2172544.

  5. Jerad Ipsen and Sudipta Mallik, Incidence and Laplacian matrices of wheel graphs and their inverses, American Journal of Combinatorics 2 (2023) 1-19.

  6. Sudipta Mallik, A new formula for the minimum distance of an expander code, J. Algebra Comb. Discrete Appl. 9(2) (2022) 79-84.

  7. Sudipta Mallik, New formulations of the union-closed sets conjecture, American Journal of Combinatorics 1 (2022) 40-46.

  8. Ryan Hessert and Sudipta Mallik, The inverse of the incidence matrix of a unicyclic graph, Linear and Multilinear Algebra (2022).

  9. Sudipta Mallik and Bahattin Yildiz, Isodual and self-dual codes from graphs, Algebra and Discrete Mathematics 32(1) (2021) 49-64.

  10. Ryan Hessert and Sudipta Mallik, Moore-Penrose inverses of the signless Laplacian and edge-Laplacian of graphs, Discrete Mathematics 344 (2021) 112451.

  11. Sudipta Mallik and Bahattin Yildiz, Graph theoretic aspects of minimum distance and equivalence of binary linear codes, Australasian Journal of Combinatorics 79(3)(2021) 515-526.

  12. Sudipta Mallik and Keivan Hassani Monfared, An analog of matrix tree theorem for signless Laplacians, Linear Algebra and its Applications 560 (2019) 43-55.

  13. Sudipta Mallik and Keivan Hassani Monfared, Spectral characterization of matchings in graphs, Linear Algebra and its Applications 496 (2016) 407-419.

  14. Sudipta Mallik and Bryan L. Shader, On graphs of minimum skew rank 4, Linear and Multilinear Algebra 64 (2016) 279-289.

  15. Sudipta Mallik and Bryan L. Shader, Integrally normalizable matrices with respect to a given set, Linear Algebra and its Applications 498 (2016) 317-325.

  16. Sudipta Mallik and Keivan Hassani Monfared, The maximum multiplicity of an eigenvalue of symmetric matrices with a given graph, http://arxiv.org/abs/1601.02760 (2016).

  17. Sudipta Mallik and Keivan Hassani Monfared, Construction of real skew-symmetric matrices from interlaced spectral data, and graph, Linear Algebra and its Applications 471 (2015) 241-263.

  18. Sudipta Mallik and Bryan L. Shader, Classes of graphs with minimum skew rank 4, Linear Algebra and its Applications 439 (2013) 3643-3657.

  19. Sudipta Mallik, Alternative proofs on the indices of cacti and unicyclic graphs with n vertices, http://arxiv.org/abs/1110.2571 (2011).

Articles in Progress
  1. S. Barik, S. Mallik, and S. U. Reddy, Complex Laplacians and their Moore-Penrose inverses.

  2. S. Mallik and S. Sivasubramanian, Generalizing a conjecture of Graham and Lovász concerning unimodality of coefficients of the distance characteristic polynomial.

  3. Sudipta Mallik and Hiranmoy Pal, State transfers on signed graph revisited.

  4. M. Rajesh Kannan, Iswar Mahato, and Sudipta Mallik, On maximum spectral radius of the eccentricity matrix of a tree.