Minimum distance-unbalancedness of trees
Sign Up to like & getrecommendations! Published in 2021 at "Journal of Mathematical Chemistry"
DOI: 10.1007/s10910-021-01228-4
Abstract: For a graph G, and two distinct vertices u and v of G, let nG(u,v)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n_{G}(u,v)$$\end{document} be the number of vertices of G that are closer in… read more here.
Keywords: distance unbalancedness; usepackage; minimum distance; unbalancedness trees ... See more keywords