相关论文: A formula for the energy of circulant graphs with …

Let $\Gamma$ be a graph with the adjacency matrix $A$. The energy of $\Gamma$ is the sum of the absolute values of the eigenvalues of $A$. In this article we compute the energies of the commuting graphs of some finite groups and discuss…

We consider circulant graphs G(r,N) where the vertices are the integers modulo N and the neighbours of 0 are {-r,...,-1,1,...,r}. The energy of G(r,N) is a trigonometric sum of N*r terms. For low values of r we compute this sum explicitly.…

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 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…

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$: $$…

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…

Let G be a non-abelian group and Z(G) be the center of G. The non-commuting graph {\Gamma}(G) of G is a graph with vertex set is non central elements of G and two vertices x, y are adjacent if and only if they are commute. In this paper we…

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…

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, has energy greater that its order. Here, the energy of a graph…

The derived graph of a voltage graph consisting of a single vertex and two loops of different voltages is a circulant graph with two generators. We characterize the automorphism groups of connected, two-generator circulant graphs, and give…

Let $\Gamma$ be a simple graph with $n$ vertices. The energy of $\Gamma$, denoted by $\mathcal{E}(\Gamma)$, is defined as the sum of the absolute values of the eigenvalues of $\Gamma$. The graph $\Gamma$ is said to be hyperenergetic if…

Let $x_1, x_2, \dots, x_n$ be the eigenvalues of a signed graph $\Gamma$ of order $n$. The energy of $\Gamma$ is defined as $E(\Gamma)=\sum^{n}_{j=1}|x_j|.$ Let $\mathcal{P}_n^4$ be obtained by connecting a vertex of the negative circle…

A signed graph $\Gamma(G)$ is a graph with a sign attached to each of its edges, where $G$ is the underlying graph of $\Gamma(G)$. The energy of a signed graph $\Gamma(G)$ is the sum of the absolute values of the eigenvalues of the…

In this note we prove that the vertex energy of a graph, as defined in Arizmendi and Juarez (2018), can be calculated in terms of a Coulson integral formula. We present examples of how this formula can be used, and we show some applications…

The graph $G_\sigma$ is obtained from graph $G$ by attaching self loops on $\sigma$ vertices. The energy $ E(G_\sigma)$ of the graph $G_\sigma$ with order $n$ and eigenvalues $\lambda_1,\lambda_2,\dots,\lambda_n$ is defined as $…

For a simple graph $G=(V,E)$ with eigenvalues of the adjacency matrix $\lambda_{1}\geq\lambda_{2}\geq\cdots\geq\lambda_{n}$, the energy of the graph is defined by $E(G)=\sum_{j=1}^{n}|\lambda_{j}|$. Myriads of papers have been published in…

Let $G$ be a finite non-abelian group and ${\Gamma}_{nc}(G)$ be its non-commuting graph. In this paper, we compute spectrum and energy of ${\Gamma}_{nc}(G)$ for certain classes of finite groups. As a consequence of our results we construct…

The energy of a graph was introduced by {\sc Gutman} in 1978 as the sum of the absolute values of the eigenvalues of its adjacency matrix. We study the energy of integral circulant graphs, also called gcd graphs, which can be characterized…

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…

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.