Answering 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{divides} μ1 {divides} + ⋯ + {divides} μn {divides} ≥ n,where μ1, ..., μn are the eigenvalues of G. We give some general results and state two conjectures. © 2007 Elsevier Inc. All rights reserved
AbstractThe energy E(G) of a graph G is the sum of the absolute values of the eigenvalues of G. An n...
AbstractGiven a graph G, its energyE(G) is defined as the sum of the absolute values of the eigenval...
Let G be a triangle-free graph with δ(G) ≥ 2 and σ4(G) ≥ |V (G)|+ 2. Let S ⊂ V (G) consist of less...
Answering some questions of Gutman, we show that, except for four specific trees, every connected gr...
AbstractAnswering some questions of Gutman, we show that, except for four specific trees, every conn...
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...
AbstractThe energy, E(G), of a simple graph G is defined to be the sum of the absolute values of the...
AbstractFor a given simple graph G, the energy of G, denoted by E(G), is defined as the sum of the a...
AbstractThe energy of a simple graph G, denoted by E(G), is defined as the sum of the absolute value...
AbstractTorgašev (1986) described all finite connected graphs whose energy (i.e. the sum of all posi...
Let G be a simple graph with n vertices, m edges and having adjacency eigenvalues λ1, λ2, …, λn. The...
Let G be a finite simple undirected graph with n vertices and m edges. For v ∈ V, the 2-degree of v ...
Let G be a finite, undirected and simple graph. If { } is the set of vertices of G, then the adjacen...
AbstractThe energy E(G) of a graph G is the sum of the absolute values of the eigenvalues of G. An n...
AbstractGiven a graph G, its energyE(G) is defined as the sum of the absolute values of the eigenval...
Let G be a triangle-free graph with δ(G) ≥ 2 and σ4(G) ≥ |V (G)|+ 2. Let S ⊂ V (G) consist of less...
Answering some questions of Gutman, we show that, except for four specific trees, every connected gr...
AbstractAnswering some questions of Gutman, we show that, except for four specific trees, every conn...
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...
AbstractThe energy, E(G), of a simple graph G is defined to be the sum of the absolute values of the...
AbstractFor a given simple graph G, the energy of G, denoted by E(G), is defined as the sum of the a...
AbstractThe energy of a simple graph G, denoted by E(G), is defined as the sum of the absolute value...
AbstractTorgašev (1986) described all finite connected graphs whose energy (i.e. the sum of all posi...
Let G be a simple graph with n vertices, m edges and having adjacency eigenvalues λ1, λ2, …, λn. The...
Let G be a finite simple undirected graph with n vertices and m edges. For v ∈ V, the 2-degree of v ...
Let G be a finite, undirected and simple graph. If { } is the set of vertices of G, then the adjacen...
AbstractThe energy E(G) of a graph G is the sum of the absolute values of the eigenvalues of G. An n...
AbstractGiven a graph G, its energyE(G) is defined as the sum of the absolute values of the eigenval...
Let G be a triangle-free graph with δ(G) ≥ 2 and σ4(G) ≥ |V (G)|+ 2. Let S ⊂ V (G) consist of less...
DOI
Add to ORKG