The Energy of Cameron-Walker Graphs
DOI:
https://doi.org/10.29020/nybg.ejpam.v18i3.6549Keywords:
Cameron-Walker graph, matching number, graph energy, lower boundAbstract
The Cameron-Walker graphs are the graphs for which their matching number equals their induced matching number. In this paper, we study lower bounds for the graph energy in terms of induced matching numbers for the general graphs with equal matching and induced matching number. Moreover, we study the lower bounds of the graph energy of Cameron-Walker graphs.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Alper Ulker, Tahsin Oner, Aiyared Iampan, Burak Ordin
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.
By agreeing to this statement, you acknowledge that:
- You retain full copyright over your work.
- The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
- This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.