The average size of independent sets of graphs

DOI10.1007/s40879-019-00333-8zbMath1439.05173arXiv1807.08290OpenAlexW2883466444WikidataQ128108555 ScholiaQ128108555MaRDI QIDQ2181915

Eric Ould Dadah Andriantiana, Valisoa Razanajatovo Misanantenaina, Stephan G. Wagner

Publication date: 20 May 2020

Published in: European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.08290

zbMATH Keywords

extremal problemstreesindependent setsaverage size

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

Related Items (6)

The average size of matchings in graphs ⋮ On the mean subtree order of graphs under edge addition ⋮ Extremal graphs for average sizes of maximal matchings ⋮ The average order of dominating sets of a graph ⋮ On the Mean Order of Connected Induced Subgraphs of Block Graphs ⋮ On the average order of a dominating set of a forest

Cites Work

• Unnamed Item
• Unnamed Item
• Extremal results on average subtree density of series-reduced trees
• Monotonicity of the mean order of subtrees
• The average order of a subtree of a tree
• On the average number of nodes in a subtree of a tree
• On the Local and Global Means of Subtree Orders
• The mean order of sub‐k‐trees of k‐trees
• On the average size of independent sets in triangle-free graphs
• Maximizing the mean subtree order
• Independent sets, matchings, and occupancy fractions

This page was built for publication: The average size of independent sets of graphs