The Mimimum 3-Covering Energy of Complete Graphs
Combinatorics
2013-03-20 v1
Abstract
In this paper we introduce a different kind of graph energy, the minimum 3-covering energy of a graph, and determine the minimum 3-covering energy of complete graphs.
Cite
@article{arxiv.1303.4579,
title = {The Mimimum 3-Covering Energy of Complete Graphs},
author = {Paul August Winter},
journal= {arXiv preprint arXiv:1303.4579},
year = {2013}
}