Commuting graphs have emerged as a powerful framework for elucidating complex relationships within finite group theory. In these graphs, vertices typically represent non-central elements of a group, ...

ABSTRACT: Let G be a connected graph with vertex set V( G ) . Then the degree resistance distance of G is defined as D R ( G )= ∑ { u,v }⊆V( G ) ( d( u )+d( v ) )R( u,v ) , where d( u ) is the degree ...

Abstract: Diameter of an undirected graph is the maximal distance between any two vertices. We can obtain a digraph (directed graph) by presenting a direction for each edge of the undirected graph.