Ordering Unicyclic Graphs with Respect to F-index
Combinatorics
2016-09-06 v1 Discrete Mathematics
Abstract
F-index of a graph is the sum of the cube of the degrees of the vertices. In this paper, we investigate the F-indices of unicyclic graphs by introducing some transformation, and characterize the unicyclic graphs with the first five largest F-indices and the unicyclic graphs with the first two smallest F-indices, respectively.
Cite
@article{arxiv.1609.01128,
title = {Ordering Unicyclic Graphs with Respect to F-index},
author = {Ruhul Amin and Sk. Md. Abu Nayeem},
journal= {arXiv preprint arXiv:1609.01128},
year = {2016}
}
Comments
14 pages, 9 figures