Sedlar–Škrekovski's mixed metric dimension conjecture
Statement
Let be a connected graph that is not a cycle. Write , let denote the minimum cardinality of a mixed metric generator of , let be the number of leaves of , and let
be its cyclomatic number. Sedlar–Škrekovski's conjecture.
Sedlar and Škrekovski proposed this bound after determining the mixed metric dimension of unicyclic graphs. The conjecture concerns the mixed metric dimension of connected graphs beyond cycles; its resolution is not established in the supplied source.
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.