The Mimimum 3-Covering Energy of Complete Graphs
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.