The Average Covering Number of a Graph

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

Bibliographic Details
Main Authors: Derya Dogan, Pinar Dundar
Format: Article
Language:English
Published: Hindawi Limited 2013-01-01
Series:Journal of Applied Mathematics
Online Access:http://dx.doi.org/10.1155/2013/849817
id doaj-7795e90d4700424dbc6d1c201b80abf4
record_format Article
spelling doaj-7795e90d4700424dbc6d1c201b80abf42020-11-24T22:31:16ZengHindawi LimitedJournal 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
collection DOAJ
language English
format Article
sources DOAJ
author Derya Dogan
Pinar Dundar
spellingShingle Derya Dogan
Pinar Dundar
The Average Covering Number of a Graph
Journal of Applied Mathematics
author_facet Derya Dogan
Pinar Dundar
author_sort Derya Dogan
title The Average Covering Number of a Graph
title_short 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_sort average covering number of a graph
publisher Hindawi Limited
series Journal of Applied Mathematics
issn 1110-757X
1687-0042
publishDate 2013-01-01
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.
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
_version_ 1725737982930976768

Similar Items