2 citations · 2 across the 3 of their papers we have counts for
7 papers
Incidence and Laplacian matrices of wheel graphs and their inverses
Jerad Ipsen, Sudipta Mallik
It has been an open problem to find the Moore-Penrose inverses of the incidence, Laplacian, and signless Laplacian matrices of families of graphs except trees and unicyclic graphs.…
The Inverse of the Incidence Matrix of a Unicyclic Graph
Ryan Hessert, Sudipta Mallik
The vertex-edge incidence matrix of a (connected) unicyclic graph G is a square matrix which is invertible if and only if the cycle of G is an odd cycle. A combinatorial formula of…
A New Formula for the Minimum Distance of an Expander Code
Sudipta Mallik
An expander code is a binary linear code whose parity-check matrix is the bi-adjacency matrix of a bipartite expander graph. We provide a new formula for the minimum distance of su…
Moore-Penrose Inverses of the Signless Laplacian and Edge-Laplacian of Graphs
Ryan Hessert, Sudipta Mallik
The signless Laplacian Q and signless edge-Laplacian S of a given graph may or may not be invertible. The Moore-Penrose inverses of Q and S are studied. In particular, using the in…
Isodual and Self-dual Codes from Graphs
Sudipta Mallik, Bahattin Yildiz
Binary linear codes are constructed from graphs, in particular, by the generator matrix where is the adjacency matrix of a graph on vertices. A combinatorial inte…
An Analog of Matrix Tree Theorem for Signless Laplacians
Keivan Hassani Monfared, Sudipta Mallik
A spanning tree of a graph is a connected subgraph on all vertices with the minimum number of edges. The number of spanning trees in a graph is given by Matrix Tree Theorem in…