Add to ORKGIn this paper we have computed minimum covering Seidel energies ofa star graph, complete graph, crown graph, complete bipartite graph and cocktailparty graphs. Upper and lower bounds for minimum covering Seidel energies of agraphs are also established. DOI : http://dx.doi.org/10.22342/jims.22.1.234.71-8
In this paper, we introduce the minimum equitable dominating Randic energy of a graph and computed t...
The concept of a new kind of graph energy, namely, minimum covering energy, denoted by Ec(G), was in...
The separate study of the two concepts of energy and vertex coverings of graphs has opened many aven...
This paper includes new bounds concepting the Seidel incidence energy. In the sequel, improved bound...
In the current literature, two interesting and innovative energy concepts of a graph, namely, the co...
Recently we introduced the concept of minimum dominating energy[21]. Motivatedby this paper,we intro...
The Seidel energy of a simple graph G is the sum of the absolute values of the eigenvalues of the Se...
The studies on the energy of a graph have been actively studied since 1978 and there have been vario...
Let G be a simple graph with n vertices, m edges and having adjacency eigenvalues λ1, λ2, …, λn. The...
summary:We give a novel upper bound on graph energy in terms of the vertex cover number, and present...
Graf spektrası, üzerinde tanımlanan M matrisinin öz değer çalışmalarıdır. Literatürde M-teori olarak...
Abstract: The energy of a graph Γ is the sum of the absolute values of the eigenvalues of the adjace...
The energy of a graph Γ is the sum of the absolute values of the eigenvalues of the adjacency matrix...
Let G be a simple graph. The incidence energy (IE for short) of G is defined as the sum of the singu...
A graph G of order n is said to be Seidel borderenergetic if its Seidel energy equals the Seidel ene...
In this paper, we introduce the minimum equitable dominating Randic energy of a graph and computed t...
The concept of a new kind of graph energy, namely, minimum covering energy, denoted by Ec(G), was in...
The separate study of the two concepts of energy and vertex coverings of graphs has opened many aven...
This paper includes new bounds concepting the Seidel incidence energy. In the sequel, improved bound...
In the current literature, two interesting and innovative energy concepts of a graph, namely, the co...
Recently we introduced the concept of minimum dominating energy[21]. Motivatedby this paper,we intro...
The Seidel energy of a simple graph G is the sum of the absolute values of the eigenvalues of the Se...
The studies on the energy of a graph have been actively studied since 1978 and there have been vario...
Let G be a simple graph with n vertices, m edges and having adjacency eigenvalues λ1, λ2, …, λn. The...
summary:We give a novel upper bound on graph energy in terms of the vertex cover number, and present...
Graf spektrası, üzerinde tanımlanan M matrisinin öz değer çalışmalarıdır. Literatürde M-teori olarak...
Abstract: The energy of a graph Γ is the sum of the absolute values of the eigenvalues of the adjace...
The energy of a graph Γ is the sum of the absolute values of the eigenvalues of the adjacency matrix...
Let G be a simple graph. The incidence energy (IE for short) of G is defined as the sum of the singu...
A graph G of order n is said to be Seidel borderenergetic if its Seidel energy equals the Seidel ene...
In this paper, we introduce the minimum equitable dominating Randic energy of a graph and computed t...
The concept of a new kind of graph energy, namely, minimum covering energy, denoted by Ec(G), was in...
The separate study of the two concepts of energy and vertex coverings of graphs has opened many aven...