WebSearch ACM Digital Library. Search Search. Advanced Search WebLiu described the relations between Wiener polarity index, Zagreb index, Wiener index, and hyper-Wiener index in [ ]; they also determined there the rst two smallest Wiener polarity indices among all unicyclic graphs. Recently, Du et al. obtained the smallest and largest Wiener polarity indices togetherwith thecorrespondinggraphs amongalltreeswith
On the quotients between the (revised) Szeged index and Wiener index …
WebOur paper is organized as follows: In Section 2, we give necessary definitions and state the main results of the paper. The first result determines the graphs with the fourth, fifth, sixth and seventh largest values on W (G) 𝑊 𝐺 W(G) italic_W ( italic_G ) among all unicyclic graphs of order n ⩾ 10; 𝑛 10 n\geqslant 10; italic_n ⩾ 10 ; while the second result … WebWiener (RRW) matrix RRW(G) of G is an n×n matrix (rij) such that rij = 1 d(G)−dij if i, j … side swept bangs for thin hair
The maximum Wiener polarity index of unicyclic graphs
WebDOI: 10.46793/match.88-1.179m Corpus ID: 245986474; Upper and Lower Bounds for Generalized Wiener Indices on Unicyclic Graphs @article{MartinezPerez2024UpperAL, title={Upper and Lower Bounds for Generalized Wiener Indices on Unicyclic Graphs}, author={'Alvaro Mart'inez-P'erez and os'e M. Rodr'iguez}, journal={Match … WebThe maximum Wiener polarity index of unicyclic graphs [J]. Appl Math Comput, 2012, … WebSZEGED INDEX OF A CLASS OF UNICYCLIC GRAPHS 1141 Lemma 3 ([10,18]). Among the n-vertex trees with n 4, S0 n is the unique graph with the second smallest Wiener index, which is equal to n2 n 2, and P0 n is the unique graph with the second largest Wiener index, which is equal to 1 6.n 3 7nC18/. The following lemma may be easily … the plog