AbstractThe energy of a graph is defined as the sum of the absolute values of all eigenvalues of the graph. F. Zhang, H. Li [On acyclic conjugated molecules with minimal energies, Discrete Appl. Math. 92 (1999) 71–84] characterized the trees with a perfect matching having the minimal and the second minimal energies, which solved a conjecture proposed by I. Gutman [Acyclic conjugated molecules, trees and their energies, J. Math. Chem. 1 (1987) 123–143]. In this letter, for a given positive integer d we characterize the tree with the minimal energy having diameter at least d. As a corollary, we also characterize the tree with the minimal Hosoya index having diameter at least d
AbstractThe energy of a graph G, denoted by E(G), is defined to be the sum of absolute values of all...
Abstract. Let G be a simple graph with n vertices and m edges. The ordinary energy of the graph is d...
AbstractThe energy E(G) of a graph G is the sum of the absolute values of the eigenvalues of G. An n...
AbstractThe energy of a graph is defined as the sum of the absolute values of all eigenvalues of the...
AbstractThe energy of a graph is defined as the sum of the absolute values of all eigenvalues of the...
AbstractThe energy of a graph is defined as the sum of the absolute values of all eigenvalues of the...
AbstractThe energy of G, denoted by E(G), is defined as the sum of the absolute values of the eigenv...
AbstractThe energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency ...
The energy of a graph is defined as the sum of absolute values of the eigenvalues of its adjacency m...
AbstractThe tree with a perfect matching having degrees not greater than three is referred to as the...
AbstractLet G be a graph on n vertices, and let CHP(G;λ) be the characteristic polynomial of its adj...
AbstractLet G be any unicyclic Hückel molecular graph with Kekulé structures on n vertices where n≥8...
Let G = (V, E) be a simple, non-trivial, finite, connected graph. A set D V is a dominating set of ...
AbstractFor a simple graph G, the energy E(G) is defined as the sum of the absolute values of all ei...
The topic of graph energy was first introduced by Ian Gutman in 1978 and arose as a problem in chemi...
AbstractThe energy of a graph G, denoted by E(G), is defined to be the sum of absolute values of all...
Abstract. Let G be a simple graph with n vertices and m edges. The ordinary energy of the graph is d...
AbstractThe energy E(G) of a graph G is the sum of the absolute values of the eigenvalues of G. An n...
AbstractThe energy of a graph is defined as the sum of the absolute values of all eigenvalues of the...
AbstractThe energy of a graph is defined as the sum of the absolute values of all eigenvalues of the...
AbstractThe energy of a graph is defined as the sum of the absolute values of all eigenvalues of the...
AbstractThe energy of G, denoted by E(G), is defined as the sum of the absolute values of the eigenv...
AbstractThe energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency ...
The energy of a graph is defined as the sum of absolute values of the eigenvalues of its adjacency m...
AbstractThe tree with a perfect matching having degrees not greater than three is referred to as the...
AbstractLet G be a graph on n vertices, and let CHP(G;λ) be the characteristic polynomial of its adj...
AbstractLet G be any unicyclic Hückel molecular graph with Kekulé structures on n vertices where n≥8...
Let G = (V, E) be a simple, non-trivial, finite, connected graph. A set D V is a dominating set of ...
AbstractFor a simple graph G, the energy E(G) is defined as the sum of the absolute values of all ei...
The topic of graph energy was first introduced by Ian Gutman in 1978 and arose as a problem in chemi...
AbstractThe energy of a graph G, denoted by E(G), is defined to be the sum of absolute values of all...
Abstract. Let G be a simple graph with n vertices and m edges. The ordinary energy of the graph is d...
AbstractThe energy E(G) of a graph G is the sum of the absolute values of the eigenvalues of G. An n...