The extremal values of some topological indices in bipartite graphs with a given matching number

Hanlin Chen, Renfang Wu and Hanyuan Deng

Applied Mathematics and Computation, 2016, vol. 280, issue C, 103-109

Abstract: Let I(G) be a topological index of a graph. If I(G+e)I(G), respectively) for each edge e∉G, then I(G) decreases (or increases, respectively) with addition of edges. In this paper, we determine the extremal values of some topological indices which decrease or increase with addition of edges, and characterize the corresponding extremal graphs in bipartite graphs with a given matching number.

Keywords: Topological indices; Bipartite graphs; Matching number (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S009630031630042X
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:280:y:2016:i:c:p:103-109

DOI: 10.1016/j.amc.2016.01.042

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 ().