The Average Covering Number of a Graph

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 tha...

Full description

Saved in:
Bibliographic Details
Main Authors: Derya Dogan, Pinar Dundar
Format: Article
Language:English
Published: Wiley 2013-01-01
Series:Journal of Applied Mathematics
Online Access:http://dx.doi.org/10.1155/2013/849817
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1849409019577368576
author Derya Dogan
Pinar Dundar
author_facet Derya Dogan
Pinar Dundar
author_sort Derya Dogan
collection DOAJ
description 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.
format Article
id doaj-art-7795e90d4700424dbc6d1c201b80abf4
institution Kabale University
issn 1110-757X
1687-0042
language English
publishDate 2013-01-01
publisher Wiley
record_format Article
series Journal of Applied Mathematics
spelling doaj-art-7795e90d4700424dbc6d1c201b80abf42025-08-20T03:35:38ZengWileyJournal of Applied Mathematics1110-757X1687-00422013-01-01201310.1155/2013/849817849817The Average Covering Number of a GraphDerya Dogan0Pinar Dundar1Department of Mathematics, Faculty of Science, Ege University, Bornova, 35100 Izmir, TurkeyDepartment of Mathematics, Faculty of Science, Ege University, Bornova, 35100 Izmir, TurkeyThere 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.http://dx.doi.org/10.1155/2013/849817
spellingShingle Derya Dogan
Pinar Dundar
The Average Covering Number of a Graph
Journal of Applied Mathematics
title The Average Covering Number of a Graph
title_full The Average Covering Number of a Graph
title_fullStr The Average Covering Number of a Graph
title_full_unstemmed The Average Covering Number of a Graph
title_short The Average Covering Number of a Graph
title_sort average covering number of a graph
url http://dx.doi.org/10.1155/2013/849817
work_keys_str_mv AT deryadogan theaveragecoveringnumberofagraph
AT pinardundar theaveragecoveringnumberofagraph
AT deryadogan averagecoveringnumberofagraph
AT pinardundar averagecoveringnumberofagraph