On the Extremal Weighted Mostar Index of Bicyclic Graphs
Sign Up to like & getrecommendations! Published in 2024 at "Axioms"
DOI: 10.3390/axioms13080519
Abstract: Let G be a simple connected graph with edge set E(G) and vertex set V(G). The weighted Mostar index of a graph G is defined as w+Mo(G)=∑e=uv∈E(G)(dG(u)+dG(v))|nu(e)−nv(e)|, where nu(e) denotes the number of vertices closer… read more here.
Keywords: mostar index; bicyclic graphs; extremal weighted; weighted mostar ... See more keywords