Scholarlink

<p>Resistance distance is an essential metric in graph theory that evaluates effective connectivity among two nodes by considering all insights into alternative paths. Inspired by electrical network theory, this concept plays a significant role in various disciplines. Resistance distance has been widely studied in various graphical networks, including trees, lattices, cyclic and distance-regular graphical networks. In this study, we investigate the resistance distance along with Kirchhoff index in a distinctive class of claw-free graphs called bi-triangular claw-free graphical network by employing methods from electrical network theory.</p>

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

Computation of resistance distance metric with Kirchhoff index in a class of bi-triangular claw-free graphical network

  • 期刊论文

  • 发表日期：

    2025年9月2日

查看全文
  • Wasim Sajjad,
  • Yi Jiang,
  • Xiang-Feng Pan

摘要

Resistance distance is an essential metric in graph theory that evaluates effective connectivity among two nodes by considering all insights into alternative paths. Inspired by electrical network theory, this concept plays a significant role in various disciplines. Resistance distance has been widely studied in various graphical networks, including trees, lattices, cyclic and distance-regular graphical networks. In this study, we investigate the resistance distance along with Kirchhoff index in a distinctive class of claw-free graphs called bi-triangular claw-free graphical network by employing methods from electrical network theory.