The Difference of Zagreb Indices of Halin Graphs
release_twt3suzjcfbslacicm43xsxq5q
by
Lina Zheng, Yiqiao Wang, Weifan Wang
Abstract
The difference of Zagreb indices of a graph G is defined as ΔM(G)=∑u∈V(G)(d(u))2−∑uv∈E(G)d(u)d(v), where d(x) denotes the degree of a vertex x in G. A Halin graph G is a graph that results from a plane tree T without vertices of degree two and with at least one vertex of degree at least three such that all leaves are joined through a cycle C in the embedded order. In this paper, we establish both lower and upper bounds on the difference of Zagreb indices for general Halin graphs and some special Halin graphs with fewer inner vertices. Furthermore, extremal graphs attaining related bounds are found.
In application/xml+jats
format
Archived Files and Locations
application/pdf 867.9 kB
file_acgu4cawvzefdpi3xjlj3in37a
|
mdpi-res.com (publisher) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
Container Metadata
Open Access Publication
In DOAJ
In ISSN ROAD
In Keepers Registry
ISSN-L:
Open Access Publication
In DOAJ
In ISSN ROAD
In Keepers Registry
ISSN-L:
2075-1680
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links
oaDOI/unpaywall (OA fulltext)
Crossref Metadata (via API)
Worldcat
SHERPA/RoMEO (journal policies)
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar
Crossref Metadata (via API)
Worldcat
SHERPA/RoMEO (journal policies)
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar