Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"Average (edge)-connectivity"”.

  1. Matchings, Connectivity, and Eigenvalues in Regular Graphs

    … $n$-vertex connected regular graphs in terms of edge-connectedness and determine when the matching number is minimized. We also establish the best upper bound for the number of cut-edges over $n$-vertex connected odd regular graphs and determine when the number of cut-edges is maximized. In …

    uiuc Repository record for Matchings, Connectivity, and Eigenvalues in Regular Graphs (opens in a new tab)