The Average Covering Number of a Graph
| dc.contributor.author | Dogan D. | |
| dc.contributor.author | Dundar P. | |
| dc.date.accessioned | 2025-04-10T11:13:38Z | |
| dc.date.available | 2025-04-10T11:13:38Z | |
| dc.date.issued | 2013 | |
| dc.description.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. © 2013 Derya Dogan and Pinar Dundar. | |
| dc.identifier.DOI-ID | 10.1155/2013/849817 | |
| dc.identifier.uri | http://hdl.handle.net/20.500.14701/49929 | |
| dc.title | The Average Covering Number of a Graph | |
| dc.type | Article |