The Average Covering Number of a Graph

Derya Dogan and Pinar Dundar

Journal of Applied Mathematics, 2013, vol. 2013, issue 1

Abstract: There are occasions when an average value of a graph parameter gives more useful information than the basic global value. In this paper, 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: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2013/849817

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2013:y:2013:i:1:n:849817

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().