Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Sudipta Mallik"'
Autor:
Sudipta Mallik, Bahattin Yildiz
Publikováno v:
Algebra and Discrete Mathematics. 32:49-64
Binary linear codes are constructed from graphs, in particular, by the generator matrix [In|A] where A is the adjacency matrix of a graph on n vertices. A combinatorial interpretation of the minimum distance of such codes is given. We also present gr
Autor:
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 the inverse of the incidence matrix of an odd unicyclic graph was kno
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8d77d748246894fbf6efb98a317b7216
http://arxiv.org/abs/2201.02580
http://arxiv.org/abs/2201.02580
Autor:
Sudipta Mallik
For a simple signed graph $G$ with the adjacency matrix $A$ and net degree matrix $D^{\pm}$, the net Laplacian matrix is $L^{\pm}=D^{\pm}-A$. We introduce a new oriented incidence matrix $N^{\pm}$ which can keep track of the sign as well as the orien
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8f54d1f7e71a88ed118a740ddfa4b0ce
Autor:
Sudipta MALLİK
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 such codes. We also provide a new proof of the result that $2(1-\varepsi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a4705692c48c01fac5cb89423e5d140b
http://arxiv.org/abs/2101.01339
http://arxiv.org/abs/2101.01339
Autor:
Sudipta Mallik, Ryan Hessert
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 incidence matrix, we find combinatorial formulas of the Moore-Penrose in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ca49660185476b08637edb7397a9de4b
http://arxiv.org/abs/2005.03702
http://arxiv.org/abs/2005.03702
Autor:
Sudipta Mallik, Bryan L. Shader
Publikováno v:
Linear Algebra and its Applications. 498:317-325
The n × n matrix A is integrally normalizable with respect to a prescribed subset M of { ( i , j ) : i , j = 1 , 2 , … , n and i ≠ j } provided A is diagonally similar to an integer matrix each of whose entries in positions corresponding to M is
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 $G$ is given by Matrix Tree Theorem in terms of principal minors of Laplacian matrix of $G$. We show a simila
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5a4912d9283cee870bddb4282a8335c6
Autor:
Bryan L. Shader, Sudipta Mallik
Publikováno v:
Linear and Multilinear Algebra. 64:279-289
The zero–nonzero pattern of a skew-symmetric matrix defines a graph. The minimum rank of all real skew-symmetric matrices with a given graph is studied. The probabilistic method is used to show that for sufficiently large , there is a regular graph
Autor:
Sudipta Mallik, Bryan L. Shader
Publikováno v:
Linear Algebra and its Applications. 439:3643-3657
The minimum skew rank of a simple graph G is the smallest possible rank among all real skew-symmetric matrices whose ( i , j ) -entry is nonzero if and only if the edge joining i and j is in G. It is known that a graph has minimum skew rank 2 if and
Autor:
Manjusha Chakraborty, Debabrata Basu, Swapankumar Ghosh, Sudipta Mallik, Jui Chakraborty, Sudip Dasgupta, Kamal Lal Das, Somoshree Sengupta
Publikováno v:
Journal of Industrial and Engineering Chemistry. 18:2211-2216
The presence of trace level ( 2 SO 4 as mobile phase and 25 mM LiCl as regenerating solution. The presence of carbonate ion in the LDH structure was found to affect the anion exchange capacity of MgAl-LDH. This has been illustrated by carrying out an