AbstractAnswering some questions of Gutman, we show that, except for four specific trees, every connected graph G of order n, with no cycle of order 4 and with maximum degree at most 3, satisfies∣μ1∣+⋯+∣μn∣⩾n,where μ1,…,μn are the eigenvalues of G.We give some general results and state two conjectures
AbstractGiven a graph G, its energyE(G) is defined as the sum of the absolute values of the eigenval...
AbstractFor a given simple graph G, the energy of G, denoted by E(G), is defined as the sum of the a...
Let G be a graph on n vertices and let λ1, λ2,..., λn be its eigenvalues. The energy of G is defined...
Answering some questions of Gutman, we show that, except for four specific trees, every connected gr...
AbstractLet λ1,λ2,…,λn be the eigenvalues of a graph G of order n. The energy of G is defined as E(G...
Let G be a graph on n vertices and m edges, with maximum degree Δ(G) and minimum degree δ(G). Let A ...
Abstract. In [3], Lepović described all connected graphs whose reduced energy, i.e., the sum of abso...
AbstractAnswering some questions of Gutman, we show that, except for four specific trees, every conn...
AbstractThe energy, E(G), of a simple graph G is defined to be the sum of the absolute values of the...
Let G be a simple graph with n vertices, m edges and having adjacency eigenvalues λ1, λ2, …, λn. The...
AbstractTorgašev (1986) described all finite connected graphs whose energy (i.e. the sum of all posi...
AbstractThe energy E(G) of a graph G is the sum of the absolute values of the eigenvalues of G. An n...
AbstractThe energy E(G) of a graph G is defined as the sum of the absolute values of its eigenvalues...
AbstractThe energy of a simple graph G, denoted by E(G), is defined as the sum of the absolute value...
In this paper we introduce the concept of maximum degree matrix M(G) of a simple graph G and obtain ...
AbstractGiven a graph G, its energyE(G) is defined as the sum of the absolute values of the eigenval...
AbstractFor a given simple graph G, the energy of G, denoted by E(G), is defined as the sum of the a...
Let G be a graph on n vertices and let λ1, λ2,..., λn be its eigenvalues. The energy of G is defined...
Answering some questions of Gutman, we show that, except for four specific trees, every connected gr...
AbstractLet λ1,λ2,…,λn be the eigenvalues of a graph G of order n. The energy of G is defined as E(G...
Let G be a graph on n vertices and m edges, with maximum degree Δ(G) and minimum degree δ(G). Let A ...
Abstract. In [3], Lepović described all connected graphs whose reduced energy, i.e., the sum of abso...
AbstractAnswering some questions of Gutman, we show that, except for four specific trees, every conn...
AbstractThe energy, E(G), of a simple graph G is defined to be the sum of the absolute values of the...
Let G be a simple graph with n vertices, m edges and having adjacency eigenvalues λ1, λ2, …, λn. The...
AbstractTorgašev (1986) described all finite connected graphs whose energy (i.e. the sum of all posi...
AbstractThe energy E(G) of a graph G is the sum of the absolute values of the eigenvalues of G. An n...
AbstractThe energy E(G) of a graph G is defined as the sum of the absolute values of its eigenvalues...
AbstractThe energy of a simple graph G, denoted by E(G), is defined as the sum of the absolute value...
In this paper we introduce the concept of maximum degree matrix M(G) of a simple graph G and obtain ...
AbstractGiven a graph G, its energyE(G) is defined as the sum of the absolute values of the eigenval...
AbstractFor a given simple graph G, the energy of G, denoted by E(G), is defined as the sum of the a...
Let G be a graph on n vertices and let λ1, λ2,..., λn be its eigenvalues. The energy of G is defined...
DOI
Add to ORKG