Spectral radius and fractional matchings

in graphs

in graphs

Suil O

Georgia State University

Georgia State University

2014/12/23 Tuesday 4PM-5PM

Room 1409

Room 1409

A fractional matching of a graph G is a function f giving each edge a number between 0 and 1 so that for each , where is the set of edges incident to v. The fractional matching number of G, written , is the maximum of over all fractional matchings f. Let G be an n-vertex graph with minimum degree d, and let be the largest eigenvalue of G. In this talk, we prove that if k is a positive integer and .

Tags: 오수일