We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Certain types of minimum covering Estrada index of graphs.
- Authors
Shooshtari, Hajar; Atapour, Maryam; Cancan, Murat
- 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.
- Subjects
UNDIRECTED graphs; BIPARTITE graphs; COCKTAIL parties
- Publication
Asian-European Journal of Mathematics, 2023, Vol 16, Issue 5, p1
- ISSN
1793-5571
- Publication type
Article
- DOI
10.1142/S1793557123500821