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...
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 |
Similar Items
-
Average weakly edge domination number in graphs
by: Mehmet Balci, et al.
Published: (2018-03-01) -
Average lower independence number in splitting graphs
by: Aysun Aytac, et al.
Published: (2016-12-01) -
On the Total Graph of Mycielski Graphs, Central Graphs and Their Covering Numbers
by: Patil H.P., et al.
Published: (2013-05-01) -
On the maximum average degree and the incidence chromatic number of a graph
by: Mohammad Hosseini Dolama, et al.
Published: (2005-12-01) -
COLLAPSIBILICATION OF A FINITE MARKOV CHAIN BY GRAPHS
by: Samim DÜNDAR, et al.
Published: (1999-01-01)