TxGraffiti's harmonic-index bound for minimal maximal matchings
Statement
Let be a nontrivial connected graph. Let denote the minimum cardinality of a maximal matching, and let denote the harmonic index of . TxGraffiti's conjecture. If is a nontrivial connected graph, then
and this bound is sharp. The conjecture links the degree-based harmonic index with a discrete edge-saturation parameter; the supplied text gives no resolution evidence.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.