Photo from wikipedia
Abstract Bapat and Sivasubramanian [4] proved a formula for the inverse of the distance matrix of a block graph. By the result of Bapat and Sivasubramanian, we give an upper… Click to show full abstract
Abstract Bapat and Sivasubramanian [4] proved a formula for the inverse of the distance matrix of a block graph. By the result of Bapat and Sivasubramanian, we give an upper bound for the second largest distance eigenvalue of a uniform block graph. Using this, we determine all block graphs whose second largest distance eigenvalues are at most − 1 2 .
Keywords:
block;
second largest;
distance;
block graph;
largest distance
Journal Title: Linear Algebra and its Applications
Year Published: 2020
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Linear Algebra and its Applications
Year Published: 2020
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!