A tight upper bound on the average order of dominating sets of a graph
From MaRDI portal
Publication:6642500
DOI10.1002/JGT.23143MaRDI QIDQ6642500
Publication date: 24 November 2024
Published in: Journal of Graph Theory (Search for Journal in Brave)
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Title not available (Why is that?)
- On the roots of domination polynomial of graphs
- Monotonicity of the mean order of subtrees
- The average order of a subtree of a tree
- Mean distance in a graph
- On the average number of nodes in a subtree of a tree
- On the roots of domination polynomials
- On the maximum mean subtree order of trees
- On the average order of a dominating set of a forest
- The path minimises the average size of a connected induced subgraph
- The average size of matchings in graphs
- The average size of independent sets of graphs
- The average order of dominating sets of a graph
- Sketchy tweets: ten minute conjectures in graph theory
- A lower bound on the average size of a connected vertex set of a graph
- On the Local and Global Means of Subtree Orders
- On the average size of independent sets in triangle-free graphs
- On the Mean Connected Induced Subgraph Order of Cographs
- Subtrees of graphs
- Introduction to Domination Polynomial of a Graph
- On the Mean Order of Connected Induced Subgraphs of Block Graphs
- Maximizing the mean subtree order
- Independent sets, matchings, and occupancy fractions
- On the Distribution of the Number of Successes in Independent Trials
- On the mean subtree order of graphs under edge addition
- The number and average size of connected sets in graphs with degree constraints
This page was built for publication: A tight upper bound on the average order of dominating sets of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6642500)
