The Mimimum 3-Covering Energy of Complete Graphs
Paul August Winter
TL;DR
This paper introduces the concept of minimum 3-covering energy in graphs and calculates its value specifically for complete graphs, expanding the understanding of graph energy measures.
Contribution
It defines a new graph energy measure called minimum 3-covering energy and determines its exact value for complete graphs, a novel contribution in graph theory.
Findings
Minimum 3-covering energy of complete graphs is determined.
Provides a new measure of graph energy related to 3-coverings.
Expands theoretical understanding of graph energies.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Graph Labeling and Dimension Problems · Advanced Graph Theory Research