The unicyclic graphs with maximum degree resistance distance

Jianhua Tu, Junfeng Du and Guifu Su

Applied Mathematics and Computation, 2015, vol. 268, issue C, 859-864

Abstract: For a connected graph with order n and size m, the cyclomatic number (=number of independent cycles) is equal to γ=m−n+1. The graphs with γ=1 are referred to the unicyclic graphs. In this paper, we characterized completely the unicyclic graphs with n vertices having maximum degree resistance distance.

Keywords: Mathematical chemistry; Resistance distance; Degree resistance distance; Unicyclic graphs (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300315008449
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:268:y:2015:i:c:p:859-864

DOI: 10.1016/j.amc.2015.06.063

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