The First Zagreb Index Conditions for Some Hamiltonian Properties of Graphs
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917768203337728 |
|---|---|
| author | Li, Rao |
| author_facet | Li, Rao |
| contents | Let $G = (V, E)$ be a graph. The first Zagreb index of a graph $G$ is defined as $\sum_{u \in V} d^2(u)$, where $d(u)$ is the degree of vertex $u$ in $G$. Using the Pólya-Szegő inequality, we in this paper present the first Zagreb index conditions for some Hamiltonian properties of a graph and an upper bound for the first Zagreb index of a graph. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_02593 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The First Zagreb Index Conditions for Some Hamiltonian Properties of Graphs Li, Rao Combinatorics Let $G = (V, E)$ be a graph. The first Zagreb index of a graph $G$ is defined as $\sum_{u \in V} d^2(u)$, where $d(u)$ is the degree of vertex $u$ in $G$. Using the Pólya-Szegő inequality, we in this paper present the first Zagreb index conditions for some Hamiltonian properties of a graph and an upper bound for the first Zagreb index of a graph. |
| title | The First Zagreb Index Conditions for Some Hamiltonian Properties of Graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2409.02593 |