图形
数学
路径(计算)
哈密顿路
哈密顿量(控制论)
索引(排版)
组合数学
计算机科学
数学优化
万维网
程序设计语言
作者
Mingqiang An,Huiya Yan
出处
期刊:Social Science Research Network
[Social Science Electronic Publishing]
日期:2022-01-01
被引量:1
摘要
The first Zagreb index $M_{1}(H)$ is equal to the sum of squares of the degrees of the vertices of the underlying graph $H$. Finding sufficient conditions for graphs to possess certainproperties is an important and meaningful problem. In this paper, we give sufficient conditions in terms of the first Zagreb index for a graph to be ${\ell}$-path-coverable or ${\ell}$-edge-Hamiltonian. All of these results are best possible.
科研通智能强力驱动
Strongly Powered by AbleSci AI