<p>Every node in a network is said to be resolved if it can be uniquely identified by a vector of distances to a specific set of nodes. The metric dimension is equivalent to the least possible cardinal number of a resolving set. Conditional resolving sets are obtained by imposing various constraints on resolving set. It is a fundamental parameter that provides insights into the structural properties and navigability of graphs, with diverse applications across different fields. This article focuses on identifying the metric dimension for a new network, star fan graph.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Metric dimension of star fan graph

  • S. Prabhu,
  • D. Sagaya Rani Jeba,
  • Sudeep Stephen

摘要

Every node in a network is said to be resolved if it can be uniquely identified by a vector of distances to a specific set of nodes. The metric dimension is equivalent to the least possible cardinal number of a resolving set. Conditional resolving sets are obtained by imposing various constraints on resolving set. It is a fundamental parameter that provides insights into the structural properties and navigability of graphs, with diverse applications across different fields. This article focuses on identifying the metric dimension for a new network, star fan graph.