Minimum absolute deviation covering chromatic energy of graphs
The study of Minimum Absolute Deviation Covering Chromatic Energy explores the relationship between graph structures and energy metrics, providing insights into optimal colouring strategies. We are introducing minimum absolute deviation of a graph covering chromatic energy G corresponding to minimum covering C of some standard graphs and their bounds also established.
Authors
- Gandikota Ramu (ORCID: https://orcid.org/0000-0001-6652-9896)
- N. Srimannarayana (ORCID: https://orcid.org/0000-0003-4982-5073)
- K. A. Venkatesh
- G. Ramesh (ORCID: https://orcid.org/0000-0002-8005-3262)
- M. V. Chakradhara Rao
Publication Details
- Journal
- Journal of Discrete Mathematical Sciences and Cryptography
- Published
- 2025-01-01
- DOI
- https://doi.org/10.47974/jdmsc-2461
- Primary Topic
- Graph Labeling and Dimension Problems
- Type
- article
- Field-Weighted Citation Impact
- 0.00