Mostar Index of Neural Networks and Applications
Sign Up to like & getrecommendations! Published in 2023 at "IEEE Access"
DOI: 10.1109/access.2023.3246734
Abstract: Neural networks are mathematical models that use learning algorithms inspired by the brain to store information. These networks have been extensively used to operate cognitive functions, robustness, fault tolerance, flexibility, collective computation, and ability to… read more here.
Keywords: index; neural networks; networks applications; network ... See more keywords
On Mostar index of trees with parameters
Sign Up to like & getrecommendations! Published in 2019 at "Filomat"
DOI: 10.2298/fil1919453h
Abstract: The Mostar index of a graph G is defined as the sum of absolute values of the differences between nu and nv over all edges uv of G, where nu and nv are respectively, the… read more here.
Keywords: index; mostar index; number; trees parameters ... See more keywords
A lower bound on the Mostar index of tricyclic graphs
Sign Up to like & getrecommendations! Published in 2024 at "Filomat"
DOI: 10.2298/fil2417291h
Abstract: For a graph G, the Mostar index of G is the sum of |nu-nv| over all edges e = uv of G, where nu denotes the number of vertices of G that have a smaller… read more here.
Keywords: mostar index; bound mostar; lower bound; graphs ... See more keywords
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