Unicyclic graphs with maximal energy

95 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Complete solution to a problem on the maximal energy of unicyclic bipartite graphs (2010, unknown): “In [10], the authors proved Theorem 1.2 that is weaker than the above conjecture, namely, E ( P 6 n ) is maximal within the class of the unicyclic bipartite n -vertex graphs differing from C n .”
On a Conjecture about Tricyclic Graphs with Maximal Energy (2013, background): “icyclic graphs. Conjecture 1.1 Amongallunicyclicgraphsonn vertices,thecycleCn hasmaximal energyif n ≤ 7 andn = 9,10,11,13 and15. Forallother valuesofn, the unicyclic graphwithmaximalenergyisP6 n . In [15], Hou et al. proved a weaker result, namely that E(P6 n) is maximal within the class of the unic”
On the Laplacian coefficients of unicyclic graphs (2009, background): “[8], who showed that among connected unicyclic bipartite n-vertex graphs either Cn or P 6 n havemaximumenergy.”
Energy of a Graph (2006, background): “As a partial answer to this conjecture, the following has been proved [6]”
Energy of digraphs (2008, background): “Unicyclic digraphs with extremal energy In [7] and [9] the authors considered the problem of finding the maximal and minimal energy among unicyclic graphs with a fixed number of vertices.”