相关论文: Randic energy of specific graphs

The graphs with all equal negative or positive eigenvalues are special kind in the spectral graph theory. In this article, several iterated line graphs $\mathcal{L}^k(G)$ with all equal negative eigenvalues $-2$ are characterized for $k\ge…

The $k^{\text{th}}$ power of a graph $G=(V,E)$, $G^k$, is the graph whose vertex set is $V$ and in which two distinct vertices are adjacent if and only if their distance in $G$ is at most $k$. This article proves various eigenvalue bounds…

The zeroth-order general Randi\'c index of graph $G=(V_G,E_G)$, denoted by $^0R_{\alpha}(G)$, is the sum of items $(d_{v})^{\alpha}$ over all vertices $v\in V_G$, where $\alpha$ is a pertinently chosen real number. In this paper, we obtain…

We provide a general framework on the coefficients of the graph polynomials of graphs which are Cartesian products. As a corollary, we prove that if $G=(V,E)$ is a graph with degrees of vertices $2d(v), v\in V$, and the graph polynomial…

A power dominating set of a graph is a set of vertices that observes every vertex in the graph by combining classical domination with an iterative propagation process arising from electrical circuit theory. In this paper, we study the power…

For a simple graph $G(V,E)$, the zeroth-order general Randi\' c index is defined as $^0R_{\alpha}(G)=\sum_{v\in V(G)}d(v)^{\alpha}$, where $d(v)$ is the degree of the vertex $v$ and $\alpha\ne0$ is a real number. The $k$-generalized…

The power graph $\mathcal{P}(G)$ of a finite group $G$ is the simple undirected graph whose vertex set is $G$, in which two distinct vertices are adjacent if one of them is an integral power of the other. For an integer $n\geq 2$, let $C_n$…

The eccentricity matrix of a graph is obtained from the distance matrix by keeping the largest entries in their row or column, and the remaining entries are replaced by zeros. The eccentricity energy of a graph is the sum of the absolute…

We consider matrices of the form $qD+A$, with $D$ being the diagonal matrix of degrees, $A$ being the adjacency matrix, and $q$ a fixed value. Given a graph $H$ and $B\subseteq V(G)$, which we call a coalescent pair $(H,B)$, we derive a…

We propose a Nordhaus-Gaddum conjecture for $q(G)$, the minimum number of distinct eigenvalues of a symmetric matrix corresponding to a graph $G$: for every graph $G$ excluding four exceptions, we conjecture that $q(G)+q(G^c)\le |G|+2$,…

There are a variety of ways to associate directed or undirected graphs to a group. It may be interesting to investigate the relations between the structure of these graphs and characterizing certain properties of the group in terms of some…

For a simple connected graph $G$ of order $n$ having distance Laplacian eigenvalues $ \rho^{L}_{1}\geq \rho^{L}_{2}\geq \cdots \geq \rho^{L}_{n}$, the distance Laplacian energy $DLE(G)$ is defined as…

Let $G$ be a graph on $n$ vertices with independence number $\alpha(G)$. Let $\mathcal{E}(G)$ be the energy of a graph, defined as the sum of the absolute values of the adjacency eigenvalues of $G$. Using Graffiti, Fajtlowicz conjectured in…

Let $R$ be a Hermitian matrix. The energy of $R$, $\mathcal{E}(R)$, corresponds to the sum of the absolute values of its eigenvalues. In this work it is obtained two lower bounds for $\mathcal{E}(R).$ The first one generalizes a lower bound…

Fix an integer $n \geq 1$, and consider the set of all connected finite simple graphs on $n$ vertices. For each $G$ in this set, let $I(G)$ denote the edge ideal of $G$ in the polynomial ring $R = K[x_1,\ldots,x_n]$. We initiate a study of…

The distinguishing number (index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling (edge labeling) with $d$ labels that is preserved only by a trivial automorphism. For any $n \in \mathbb{N}$,…

The purpose of this paper is to study spectral properties of a family of Cayley graphs on finite commutative rings. Let $R$ be such a ring and $R^\times$ its set of units. Let $Q_R=\{u^2: u\in R^\times\}$ and $T_R=Q_R\cup(-Q_R)$. We define…

For a graph $G=(V,E)$, its exact-distance square, $G^{[\sharp 2]}$, is the graph with vertex set $V$ and with an edge between vertices $x$ and $y$ if and only if $x$ and $y$ have distance (exactly) $2$ in $G$. The graph $G$ is an…

Let $D(G)$ denote the distance matrix of a connected graph $G$ with $n$ vertices. The distance spectral gap of a graph $G$ is defined as $\delta_{D^G} = \rho_1 - \rho_2$, where $\rho_1$ and $\rho_2$ represent the largest and second largest…

In this paper we characterize "large" regular graphs using certain entries in the projection matrices onto the eigenspaces of the graph. As a corollary of this result, we show that "large" association schemes become $P$-polynomial…