Abstract
Let G be a simple, finite, undirected graph with n vertices. The main purpose of this paper introduces the concepts of the minimum covering Gutman Estrada index, the minimum covering Seidel Estrada index, the minimum covering distance Estrada index, the minimum covering Randić Estrada index, the minimum covering Harary Estrada index, and the minimum covering color Estrada index of a graph. First, we compute the new concepts for some of the graphs, such as cocktail party, star, crown, complete and complete bipartite. Moreover, we establish upper and lower bounds for the new concepts.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
