Sedlar–Škrekovski mixed metric-dimension conjecture
Statement
For every connected graph that is not a cycle, the mixed metric dimension satisfies , where is the number of leaves and is the cyclomatic number. Moreover, equality holds if and only if is either a cactus graph in which every cycle has precisely one vertex of degree at least , or a balanced -graph.
Record
- Added
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.