相关论文: On Randi\'c energy of a vertex

In this paper we develop the concept of energy of a vertex introduced in Arizmendi and Juarez-Romero (2016). We derive basic inequalities, continuity properties, give examples and extend the definition to locally finite graphs.

Let $G$ be a simple graph of order $n$. The energy $E(G)$ of the graph $G$ is the sum of the absolute values of the eigenvalues of $G$. The Randi\'{c} matrix of $G$, denoted by $R(G)$, is defined as the $n\times n$ matrix whose…

Graph energy has been widely investigated in spectral graph theory. However, the manner in which this energy is distributed among individual vertices has received attention only more recently, following the introduction of energy of a…

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…

In this paper, we consider the Randi\'{c} energy $RE$ of simple connected graphs. We provide upper bounds for $RE$ in terms of the number of vertices and the nullity of the graph. We present families of graphs that satisfy the Conjecture…

The energy of a vertex $v_i$ in a graph $G$ is defined as $\mathcal{E}_G(v_i) = |A|_{ii}$, where $A$ is the adjacency matrix of $G$, $A^*$ denotes the conjugate transpose of $A$, and $|A| = (AA^*)^{1/2}$. The total energy of the graph,…

Let $G$ be a simple graph with vertex set $V(G) = \{v_1, v_2,\ldots, v_n\}$ and edge set $E(G) = \{e_1, e_2,\ldots, e_m\}$. Similar to the Randi\'c matrix, here we introduce the Randi\'c incidence matrix of a graph $G$, denoted by $I_R(G)$,…

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…

Graph energy is the energy of the matrix representation of the graph, where the energy of a matrix is the sum of singular values of the matrix. Depending on the definition of a matrix, one can contemplate graph energy, Randi\'c energy,…

Let $G$ be a simple graph with vertex set $V(G) = \{v_1, v_2,..., v_n\}$. The Randi\'{c} matrix of $G$, denoted by $R(G)$, is defined as the $n\times n$ matrix whose $(i,j)$-entry is $(d_id_j)^{\frac{-1}{2}}$ if $v_i$ and $v_j$ are adjacent…

Let $G$ be a graph of order $n$, and $d_i$ the degree of a vertex $v_i$ of $G$. The Randi\'c matrix ${\bf R}=(r_{ij})$ of $G$ is defined by $r_{ij} = 1 / \sqrt{d_jd_j}$ if the vertices $v_i$ and $v_j$ are adjacent in $G$ and $r_{ij}=0$…

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.

The energy of a graph $G$ is the sum of the absolute values of the eigenvalues of the adjacency matrix of $G$. Some variants of energy can also be found in the literature which are defined on the concepts of Laplacian matrix, Distance…

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 $M$ be a mixed graph and $H(M)$ be its Hermitian-adjacency matrix. If we add every edge and arc in $M$ a Randi\'c weight, then we can get a new weighted Hermitian-adjacency matrix. What are the properties of this new matrix? Motivated…

We give a new inequality between the energy of a graph and a weighted sum over the edges of the graph. Using this inequality we prove that $\mathcal{E}(G)\geq 2R(H)$, where $ \mathcal{E}(G)$ is the energy of a graph $G$ and $R(H)$ is the…

We study the energy per vertex in regular graphs. For every k, we give an upper bound for the energy per vertex of a k-regular graph, and show that a graph attains the upper bound if and only if it is the disjoint union of incidence graphs…

We introduce the vertex Seidel energy via the diagonal entries of the absolute Seidel matrix. We establish a spectral formula, compute exact values for several graph families, derive bounds, and present a Coulson-type integral…

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…

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…