相关论文: The exact maximal energy of integral circulant gra…

The energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. We study the energy of integral circulant graphs, also called gcd graphs, which can be characterized by their vertex count n and a set D of divisors…

The energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. We study the energy of integral circulant graphs, also called gcd graphs, which can be characterized by their vertex count $n$ and a set $\cal D$ of…

Circulant graphs are an important class of interconnection networks in parallel and distributed computing. Integral circulant graphs play an important role in modeling quantum spin networks supporting the perfect state transfer as well. The…

The energy of a graph is the sum of the absolute values of its adjacency eigenvalues. For integral circulant graphs $\ICG(n,\mathcal{D})$ of order $n=p^2q^3$, where $p$ and $q$ are distinct odd primes, we prove that the adjacency…

The energy of a simple graph $G$, denoted by $E(G)$, is defined as the sum of the absolute values of all eigenvalues of its adjacency matrix. Let $C_n$ denote the cycle of order $n$ and $P^{6,6}_n$ the graph obtained from joining two cycles…

We extend the concept of graph energy, introduced by Gutman, to matrices. We give upper and lower bounds on matrix energy extending previous results for graphs. In particular, we estimate the energy of almost all graphs.

In 1970s, Gutman introduced the concept of the energy $\En(G)$ for a simple graph $G$, which is defined as the sum of the absolute values of the eigenvalues of $G$. This graph invariant has attracted much attention, and many lower and upper…

Gutman and Wagner proposed the concept of the matching energy (ME) and pointed out that the chemical applications of ME go back to the 1970s. Let $G$ be a simple graph of order $n$ and $\mu_1,\mu_2,\ldots,\mu_n$ be the roots of its matching…

The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. This note is about the energy of regular graphs. It is shown that graphs that are close to regular can be made regular with a negligible…

The energy of a simple graph $G$, denoted by $E(G)$, is defined as the sum of the absolute values of all eigenvalues of its adjacency matrix. Denote by $C_n$ the cycle, and $P_n^{6}$ the unicyclic graph obtained by connecting a vertex of…

For a given simple graph $G$, the energy of $G$, denoted by $\mathcal {E}(G)$, is defined as the sum of the absolute values of all eigenvalues of its adjacency matrix, which was defined by I. Gutman. The problem on determining the maximal…

Let G be a simple graph on n vertices with vertex set V(G). The energy of G, denoted by, $\mathcal{E}(G)$ is the sum of all absolute values of the eigenvalues of the adjacency matrix $A(G)$. It is the first eigenvalue-based topological…

Let $G$ be a graph with $n$ vertices and $m$ edges. The energy $E$ of the graph $G$ is defined as the sum of the moduli of the adjacency eigenvalues $\lambda_{1} \geq \lambda_{2} \geq \ldots \geq \lambda_{n}$ of $G$: $$…

Suppose G is an n-vertex simple graph with vertex set {v1,..., vn} and d(i), i = 1,..., n, is the degree of vertex vi in G. The ISI matrix S(G) = [sij] of G is a square matrix of order n and is defined by sij = d(i)d(j)/d(i)+d(j) if the…

For a given simple graph $G$, the energy of $G$, denoted by $E(G)$, is defined as the sum of the absolute values of all eigenvalues of its adjacency matrix. Let $P_n^{\ell}$ be the unicyclic graph obtained by connecting a vertex of $C_\ell$…

In 1978, motivated by E. H\"uckel's work in quantum chemistry, I. Gutman introduced the concept of the energy of a finite simple graph $G$ as the sum of the absolute values of the eigenvalues of the adjacency matrix of $G$. At the time of…

The extended adjacency matrix of a graph with $n$ vertices is a real symmetric matrix of order $n\times n$ whose $(i,j)$-th entry is the average of the ratio of the degree of the vertex $i$ to that of the vertex $j$ and its reciprocal when…

The energy of a graph $G$, denoted by $E(G)$, is defined as the sum of the absolute values of all eigenvalues of $G$. Let $G$ be a graph of order $n$ and ${\rm rank}(G)$ be the rank of the adjacency matrix of $G$. In this paper we…

We give a bound for the graph energy with given maximal degree in terms of the second and fourth moments of a graph. In the case in which the graph is $d$-regular we obtain the bound that is given in Van Dam, E. et al. (2014). through…

The energy of a graph is defined as the sum the absolute values of the eigenvalues of its adjacency matrix. A threshold graph G on n vertices is coded by a binary sequence of length n. In this paper we answer a question posed by Jacobs et…