Emergent Mind
Minimum status, matching and domination of graphs
(1909.03381)
Published Sep 8, 2019
in
cs.DM
and
math.CO
Abstract
The minimum status of a graph is the minimum of statuses of all vertices of this graph. We give a sharp upper bound for the minimum status of a connected graph with fixed order and matching number (domination number, respectively), and characterize the unique trees achieving the bound. We also determine the unique tree such that its minimum status is as small as possible when order and matching number (domination number, respectively) are fixed.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.