The average covering number of a graph
 
 
Description:  There are occasions when an average value of a graph parameter gives more useful information than the basic global value. In this talk, we introduce the concept of the average covering number of a graph (the covering number of a graph is the minimum number of vertices in a set with the property that every edge has a vertex in the set). We establish relationships between the average covering number and some other graph parameters, find the extreme values of the average covering number among all graphs of a given order, and find the average covering number for some families of graphs.
Date:  2014-06-23
Start Time:   14:30
Speaker:  Derya Dogan (Celal Bayar Univ., Turkey)
Institution:  Celal Bayar University, Turkey
Place:  Room 5.5, DMat
Research Groups: -Algebra and Combinatorics
See more:   <Main>  
 
© Centre for Mathematics, University of Coimbra, funded by
Science and Technology Foundation
Powered by: rdOnWeb v1.4 | technical support