On the maximum ABC index of bipartite graphs without pendent vertices
نویسندگان
چکیده
منابع مشابه
On the sum-connectivity index of unicyclic graphs with k pendent vertices
The sum-connectivity index R′(G) of a graph G is the sum of the weights (du +dv) − 2 of all edges uv of G, where du and dv are the degrees of the vertices u and v in G. This index was recently introduced in [B. Zhou, N. Trinajstić, On a novel connectivity index, J. Math. Chem. 46(2009), 1252–1270]. In this paper, we give the sharp lower bound of the sum-connectivity index of n-vertex unicyclic ...
متن کاملOn Merrifield-Simmons index of unicyclic graphs with given girth and prescribed pendent vertices
For a graph G, the Merrifield-Simmons index i(G) is defined as the total number of independent sets of the graph G. Let G(n, l, k) be the class of unicyclic graphs on n vertices with girth and pendent vertices being resp. l and k. In this paper, we characterize the unique unicyclic graph possessing prescribed girth and pendent vertices with the maximal Merrifield-Simmons index among all graphs ...
متن کاملOn the Laplacian Coefficients and Laplacian-Like Energy of Unicyclic Graphs with Vertices and Pendent Vertices
Copyright q 2012 X. Pai and S. Liu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Let Φ G, λ det λIn − L G ∑n k 0 −1 ck G λn−k be the characteristic polynomial of the Laplacian matrix of a graph G of order n. In this paper, we g...
متن کاملgraphs with fixed number of pendent vertices and minimal first zagreb index
the first zagreb index $m_1$ of a graph $g$ is equal to the sum of squaresof degrees of the vertices of $g$. goubko proved that for trees with $n_1$pendent vertices, $m_1 geq 9,n_1-16$. we show how this result can beextended to hold for any connected graph with cyclomatic number $gamma geq 0$.in addition, graphs with $n$ vertices, $n_1$ pendent vertices, cyclomaticnumber $gamma$, and minimal $m...
متن کاملThe spectral radius of tricyclic graphs with n vertices and k pendent vertices
In this paper, we determine graphs with the largest spectral radius among all the tricyclic graphs with n vertices and k pendent vertices. © 2008 Elsevier Inc. All rights reserved. AMS classification: 05C50; 05C35
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Chemistry
سال: 2020
ISSN: 2391-5420
DOI: 10.1515/chem-2020-0002