The Average Covering Number of a Graph
| dc.contributor.author | Dogan, D | |
| dc.contributor.author | Dundar, P | |
| dc.date.accessioned | 2024-07-18T12:01:27Z | |
| dc.date.available | 2024-07-18T12:01:27Z | |
| 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. | |
| dc.identifier.issn | 1110-757X | |
| dc.identifier.other | 1687-0042 | |
| dc.identifier.uri | http://akademikarsiv.cbu.edu.tr:4000/handle/123456789/8438 | |
| dc.language.iso | English | |
| dc.publisher | HINDAWI LTD | |
| dc.subject | INDEPENDENCE | |
| dc.subject | CONNECTIVITY | |
| dc.subject | DOMINATION | |
| dc.title | The Average Covering Number of a Graph | |
| dc.type | Article |