1 problem

0 votes0 replies0 views
The spanning-tree upper-bound conjecture for partition dimension of unicyclic graphs
Let $G$ be a unicyclic graph and let $T$ be a spanning tree of $G$ . The spanning-tree upper-bound conjecture. If $T$ is a spanning tree of a unicyclic graph $G$ , then … This conjec…
Conjectureopengraph-theory partition-dimension unicyclic-graphsarXiv posted 2 days ago

The spanning-tree upper-bound conjecture for partition dimension of unicyclic graphs