Maximum first Zagreb index of orientations of unicyclic graphs with given matching number

Jiaxiang Yang and Hanyuan Deng

Applied Mathematics and Computation, 2022, vol. 427, issue C

Abstract: Let D=(V,A) be a digraphs without isolated vertices. The first Zagreb index of a digraph D is defined as a summation over all arcs, M1(D)=12∑uv∈A(du++dv−), where du+(resp. du−) denotes the out-degree (resp. in-degree) of the vertex u. In this paper, we give the maximal values and maximal digraphs of first Zagreb index over the set of all orientations of unicyclic graphs with n vertices and matching number m(2≤m≤⌊n2⌋).

Keywords: First zagreb index; Orientations of unicyclic graphs; Matching number (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300322002156
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:427:y:2022:i:c:s0096300322002156

DOI: 10.1016/j.amc.2022.127131

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().