The sufficient conditions for k-leaf-connected graphs in terms of several topological indices

arXiv2304.07093MaRDI QIDQ6509645FDOQ6509645

Authors: Tingyan Ma, Ligong Wang, Yang Hu 

Abstract: Let $G=(V(G),E(G))$ be a graph with vertex set $V(G)$ and edge set $E(G)$. For $kgeq2$ and given any subset $Ssubseteq|V(G)|$ with $|S|=k$, if a graph $G$ of order $|V(G)|geqk+1$ always has a spanning tree $T$ such that $S$ is precisely the set of leaves of $T$, then the graph $G$ is a $k$-leaf-connected graph. A graph $G$ is called Hamilton-connected if any two vertices of $G$ are connected by a Hamilton path. Based on the definitions of $k$-leaf-connected and Hamilton-connected, we known that a graph is $2$-leaf-connected if and only if it is Hamilton-connected. During the past decades, there have been many results of sufficient conditions for Hamilton-connected with respect to topological indices. In this paper, we present sufficient conditions for a graph to be $k$-leaf-connected in terms of the Zagreb index, the reciprocal degree distance or the hyper-Zagreb index. Furthermore, we use the first (hyper-)Zagreb index of the complement graph to give sufficient conditions for a graph to be $k$-leaf-connected.

Mathematics Subject Classification ID

Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Extremal problems in graph theory (05C35)

This page was built for publication: The sufficient conditions for $k$-leaf-connected graphs in terms of several topological indices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6509645)