"Eigenvalues and Spanning Tree Packing of Graphs" by Hong-Jian Lai
 

Document Type

Lecture

Publication Date

3-6-2015

Abstract

The problem in this research is to investigate the relationship between the eigenvalues (adjacency eigenvalues, algebraic connectivity, or signless Laplace eigenvalues) of a graph and the maximum number of spanning trees that can be packed in the graph. This talk will present some recent developments on this problem.

Relational Format

presentation

Download

Plum Print visual indicator of research metrics
PlumX Metrics
  • Usage
    • Downloads: 5
see details

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.