The average covering number of a graph

DOI10.1155/2013/849817MaRDI QIDQ1791346zbMATH OpenOpenAlexWikidataFDO

Authors Derya Dogan, Pinar Dundar

Publication date 10 October 2018

Published in Journal of Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2013/849817

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90)

Review text

Summary: 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.

Recommendations

• Average covering number for some graphs
• On average lower independence and domination numbers in graphs
• The average distance and the independence number
• scientific article; zbMATH DE number 4150222
• The average order of dominating sets of a graph

Cited in

(1)

• Average covering number for some graphs

This page was built for publication: The average covering number of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1791346)