We study the average number A(G) of colors in the non-equivalent colorings of a graph G. We show some general properties of this graph invariant and determine its value for some classes of graphs. We then conjecture several lower bounds on A(G) and prove that these conjectures are true for specific classes of graphs such as triangulated graphs and graphs with maximum degree at most 2.
We investigate the ratio I(G) of the average size of a maximal matching to the size of a maximum matching in a graph G. If many maximal matchings have a size close to ν(G), this graph invariant has a value close to 1. Conversely, if many maximal matchings have a small size, I(G) approaches 1 2 . We propose a general technique to determine the asymptotic behavior of I(G) for various classes of graphs. To illustrate the use of this technique, we first show how it makes it possible to find known asymptotic values of I(G) which were typically obtained using generating functions, and we then determine the asymptotic value of I(G) for other families of graphs, highlighting the spectrum of possible values of this graph invariant between 1 2 and 1.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.