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...
Saved in:
| 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!
|
Similar Items
-
Characteristics of Complexity: Clique Number of a Polytope Graph and Rectangle Covering Number
by: A. N. Maksimenko
Published: (2014-10-01) -
Graphs with Bounded Maximum Average Degree and Their Neighbor Sum Distinguishing Total-Choice Numbers
by: Patcharapan Jumnongnit, et al.
Published: (2017-01-01) -
The Average Lower Connectivity of Graphs
by: Ersin Aslan
Published: (2014-01-01) -
Graph-Theoretic Limits of Distributed Computation: Entropy, Eigenvalues, and Chromatic Numbers
by: Mohammad Reza Deylam Salehi, et al.
Published: (2025-07-01) -
Average Analytic Ranks of Elliptic Curves over Number Fields
by: Tristan Phillips
Published: (2025-01-01)