2000 character limit reached
Sufficient conditions for matching extendability in terms of the Zeroth-order General Randić Index
Published 26 Nov 2023 in math.CO | (2311.15223v3)
Abstract: Topological indices are important bridge between graph theory and chemical applications. The study of graph matching expandability has been an influential topic in recent research on graph structure. In this paper, we provide some sufficient conditions for a graph to be $k$-extendable graphs, $n$-factor-critical graphs and $(n,k,d)$-graphs and graphs with prefect matching in terms of a significant type of Topological index: the Zeroth-order General Randi\'c Index ($\alpha\ge-1$ and $\alpha\neq 0$).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.