加载中…
A signed graph is a pair , where is the underlying graph in which each edge is assigned or by the signature function . In this paper, we extend the extensively applied concepts of metric dimension and resolving sets for unsigned graphs to signed graphs. We analyze the metric dimension of some well known classes of signed graphs including a special case of signed trees. Among other things, we establish that the metric dimension of a signed graph is invariant under negation.

生成讲解博客的中文版本

生成AI智能校验的中文版本