Some bond incident degree indices of (molecular) graphs with fixed order and number of cut vertices
Summary: A bond incident degree (BID) index of a graph \(G\) is defined as \(\sum_{u v \in E (G)} f (d_G(u), d_G (v))\), where \(d_G(w)\) denotes the degree of a vertex \(w\) of \(G\), \(E(G)\) is the edge set of \(G\), and \(f\) is a real-valued symmetric function. The choice \(f(d_G(u), d_G (v))= a^{d_G(u)}+ a^{d_G(v)}\) in the aforementioned formula gives the variable sum exdeg index \(\mathrm{SEI}_a\), where \(a\neq 1\) is any positive real number. A cut vertex of a graph \(G\) is a vertex whose removal results in a graph with more components than \(G\) has. A graph of maximum degree at most 4 is known as a molecular graph. Denote by \(\mathbb{V}_{n,k}\) the class of all \(n\)-vertex graphs with \(k\geq 1\) cut vertices and containing at least one cycle. Recently, \textit{J. Du} and \textit{X. Sun}, characterized the graphs having the maximum value of \(\mathrm{SEI}_a\) from the set \(\mathbb{V}_n^k\) for \(a>1\) [``On the graph connectivity and the variable sum exdeg index, AIMS Math. 6, No. 1, 607--622 (2021; \url{doi:10.3934/math.2021037})]. In the present paper, we not only characterize the graphs with the minimum value of \(\mathrm{SEI}_a\) from the set \(\mathbb{V}_n^k\) for \(a>1\), but we also solve a more general problem concerning a special type of BID indices. As the obtained extremal graphs are molecular graphs, they remain extremal if one considers the class of all \(n\)-vertex molecular graphs with \(k\geq 1\) cut vertices and containing at least one cycle.
- On bond incident degree indices of (n,m)-graphs
- On bond incident degree indices of connected graphs with fixed order and number of pendent vertices
- On the extremal graphs with respect to bond incident degree indices
- On (exponential) bond incident degree indices of graphs
- On atom bond connectivity index of some molecular graphs
- Wiener and Schultz molecular topological indices of graphs with specified cut edges
- On acyclic molecular graphs with prescribed numbers of edges that connect vertices with given degrees
- scientific article; zbMATH DE number 6700480
- On the symmetric division deg index of molecular graphs
- On molecular graphs with smallest and greatest zeroth-order general Randić index
- A note on the variable sum exdeg index/coindex of trees
- Asymptotic Laplacian-energy-like invariant of lattices
- Bond incident degree (BID) indices of polyomino chains: a unified approach
- Extremal graphs with respect to variable sum exdeg index via majorization
- Extremal polygonal cacti for bond incident degree indices
- Extremal problems on the variable sum Exdeg Index
- Graph theory
- scientific article; zbMATH DE number 6506585 (Why is no real title available?)
- scientific article; zbMATH DE number 7427118 (Why is no real title available?)
- On molecular graphs with smallest and greatest zeroth-order general Randić index
- On multiplicative Zagreb indices of graphs
- On the graph connectivity and the variable sum exdeg index
- On the variable sum exdeg index and cut edges of graphs
- On variable sum exdeg indices of quasi-tree graphs and unicyclic graphs
- On the extremal graphs with respect to bond incident degree indices
- On bond incident degree indices of (n,m)-graphs
- On (exponential) bond incident degree indices of graphs
- Some bounds on bond incident degree indices with some parameters
- Bond incident degree indices of connected \((n, m)\)-graphs with fixed maximum degree
This page was built for publication: Some bond incident degree indices of (molecular) graphs with fixed order and number of cut vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2059288)
