Sibasish Ghosh
2002–2004
A researcher in the Science corpus: 2 papers; trusts 0 researchers and is trusted by 3 researchers here, as inferred from the citation graph.
Who trusts Sibasish Ghosh overall
Papers from Sibasish Ghosh's perspective
Ordered by how strongly the researchers Sibasish Ghosh trusts endorse each paper. Same corpus, a different order for every researcher.
- Entanglement of formation and concurrence (Quantum information & computation)
- Algebraic Graph Theory
- Walks and the spectral radius of graphs
- A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph
- Which graphs are determined by their spectrum
- Signless Laplacians of finite graphs
- The spectral radius of trees on k pendant vertices
- Signless Laplacians and line graphs
- Spectral Generalizations of Line Graphs: On Graphs with Least Eigenvalue -2
- Topics in algebraic graph theory
Their papers
- The Laplacian of a Graph as a Density Matrix: A Basic Combinatorial Approach to Separability of Mixed States (2004) — 187 citations
- Distinguishability of maximally entangled states (2002) — 143 citations