Ranveer Singh

Hitesh Wankhede

Appl. Math. Comput., 2024

2022

SRF: Random Expanders for Designing Scalable Robust and Fast Communication Networks.

[BibT_eX]

[DOI]

Pradumn Kumar Pandey

A. K. Lal

IEEE Trans. Circuits Syst. II Express Briefs, 2022

A linear time algorithm for the nullity of vertex-weighted block graphs.

[BibT_eX]

[DOI]

Avi Berman

Discret. Appl. Math., 2022

On the second largest eigenvalue of networks.

[BibT_eX]

[DOI]

Ankit Mishra

Sarika Jalan

Appl. Netw. Sci., 2022

2021

Fast Average-Consensus on Networks Using Heterogeneous Diffusion.

[BibT_eX]

[DOI]

Pradumn Kumar Pandey

IEEE Trans. Circuits Syst. II Express Briefs, 2021

2020

Parameterized complexity of determinant and permanent.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

2019

Nonsingular (Vertex-Weighted) Block Graphs.

[BibT_eX]

[DOI]

Cheng Zheng

Abraham Berman

CoRR, 2019

Linear Time Algorithm to Check the Singularity of Block Graphs.

[BibT_eX]

[DOI]

Avi Berman

Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018

Concurrence and three-tangle of the graph.

[BibT_eX]

[DOI]

Anoopa Joshi

Atul Kumar

Quantum Inf. Process., 2018

Algorithm for B-partitions, parameterized complexity of the matrix determinant and permanent.

[BibT_eX]

[DOI]

Vivek Vijay

CoRR, 2018

Rank of weighted digraphs with blocks.

[BibT_eX]

[DOI]

Swarup Kumar Panda

Abraham Berman

CoRR, 2018

2017

$\mathcal{B}$-partitions, application to determinant and permanent of graphs.

[BibT_eX]

[DOI]

CoRR, 2017

Eigenvalues of some signed graphs with negative cliques.

[BibT_eX]

[DOI]

CoRR, 2017

On a Characteristic and Permanent Polynomials of Matrix.

[BibT_eX]

[DOI]

CoRR, 2017

2015

A Complex Network Approach for Collaborative Recommendation.

[BibT_eX]

[DOI]