9 citations · 13 across the 3 of their papers we have counts for
3 papers
cs.DC2022
Most, And Least, Compact Spanning Trees of a Graph
Gyan Ranjan, Nishant Saurabh, Amit Ashutosh
We introduce the concept of Most, and Least, Compact Spanning Trees - denoted respectively by and - of a simple, connected, undirected and unweighted graph $G(V,…
cs.DM2013★ 9 cited
Incremental Computation of Pseudo-Inverse of Laplacian: Theory and Applications
Gyan Ranjan, Zhi-Li Zhang, Daniel Boley
A divide-and-conquer based approach for computing the Moore-Penrose pseudo-inverse of the combinatorial Laplacian matrix $(\bb L^+)$ of a simple, undirected graph is proposed. % Th…
cs.DM2011★ 4 cited
Geometry of Complex Networks and Topological Centrality
Gyan Ranjan, Zhi-Li Zhang
We explore the geometry of complex networks in terms of an n-dimensional Euclidean embedding represented by the Moore-Penrose pseudo-inverse of the graph Laplacian $(\bb L^+)$. The…