Graphs and Matrices

By Ravindra B. Bapat. 2014

289 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Vision and Pattern Recognition, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/2b891265a516dd57ac32dac9ca83e027a752405a

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Aniruddha Samanta
2. Ranjit Mehatari
3. M. Rajesh Kannan

In Computer Vision and Pattern Recognition

1. Aniruddha Samanta
2. Ranjit Mehatari
3. M. Rajesh Kannan

In Geometry and Topology

1. Aniruddha Samanta
2. Ranjit Mehatari
3. M. Rajesh Kannan

Citations in the corpus

• On the adjacency matrix of a complex unit gain graph (2018, methodology): “The following result is known for the adjacency matrices [1] – however, the proof technique the different from the adjacency matrix case.”
• On the spectrum of hypergraphs (2017, unknown): “22 in [5] we have λmax(AG) + (k − 1)λmin(AG) ≤ 0.”