English
Related papers

Related papers: On Euler-Sombor Energy of Graphs

200 papers

The Zero divisor Graph of a commutative ring $R$, denoted by $\Gamma[R]$, is a graph whose vertices are non-zero zero divisors of $R$ and two vertices are adjacent if their product is zero. In this paper, we consider the zero divisor graph…

Rings and Algebras · Mathematics 2017-07-18 B. Surendranath Reddy , Rupali. S. Jain , N. Laxmikanth

For a graph $G=(V,E)$ and $v_{i}\in V$, denote by $d_{v_{i}}$ (or $d_{i}$ for short) the degree of vertex $v_{i}$. The $p$-Sombor matrix $\textbf{S}_{\textbf{p}}(G)$ ($p\neq0$) of a graph $G$ is a square matrix, where the $(i,j)$-entry is…

Combinatorics · Mathematics 2023-04-06 Ruiling Zheng , Tianlong Ma , Xian'an Jin

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…

Combinatorics · Mathematics 2011-02-18 Bofeng Huo , Shengjin Ji , Xueliang Li , Yongtang Shi

Let $(G,w)$ be a weighted graph with a weight-function $w: E(G)\to \mathbb R\backslash\{0\}$. A weighted graph $(G,w)$ is invertible to a new weighted graph if its adjacency matrix is invertible. A graph inverse has combinatorial interest…

Combinatorics · Mathematics 2015-06-15 Dong Ye , Yujun Yang , Bholanath Mandal , Douglas J. Klein

Eigenvector centrality is one of the outstanding measures of central tendency in graph theory. In this paper we consider the problem of calculating eigenvector centrality of graph partitioned into components and how this partitioning can be…

A new geometric background of graph invariants was introduced by Gutman, of which the simplest is the second Sombor index $SO_2$, defined as $SO_2=SO_2(G)=\sum_{uv\in E}\frac{|d^2_G(u)-d^2_G(v)|}{d^2_G(u)+d^2_G(v)}$, where $G = (V, E)$ is a…

Combinatorics · Mathematics 2022-08-22 Zikai Tang , Hanyuan Deng

The F-index of a graph is defined as the sum of cubes of the vertex degrees of the graph. This was introduced in 1972, in the same paper where the first and second Zagreb indices were introduced to study the structure-dependency of total…

Combinatorics · Mathematics 2015-11-23 Nilanjan De , Sk. Md. Abu Nayeem , Anita Pal

We study the graph energy from a cooperative game viewpoint. We introduce \emph{the graph energy game} and show various properties. In particular, we see that it is a superadditive game and that the energy of a vertex, as defined in…

Spectral Theory · Mathematics 2021-03-22 Gerardo Arizmendi , Octavio Arizmendi

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…

Combinatorics · Mathematics 2014-09-09 Lin Chen , Yongtang Shi

Let $S(G^\sigma)$ be the skew-adjacency matrix of an oriented graph $G^\sigma$. The skew energy of $G^\sigma$ is defined as the sum of all singular values of its skew-adjacency matrix $S(G^\sigma)$. In this paper, we first deduce an…

Combinatorics · Mathematics 2013-04-10 Shicai Gong , Xueliang Li , Guanghui Xu

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…

Combinatorics · Mathematics 2021-03-01 Octavio Arizmendi , Jorge Fernandez Hidalgo

Topological indices are a class of numerical invariants that predict certain physical and chemical properties of molecules. Recently, two novel topological indices, named as Sombor index and reduced Sombor index, were introduced by Gutman,…

Combinatorics · Mathematics 2021-08-24 Hechao Liu , Lihua You , Yufei Huang

The Euler characteristic $\chi =|V|-|E|$ and the total length $\mathcal{L}$ are the most important topological and geometrical characteristics of a metric graph. Here, $|V|$ and $|E|$ denote the number of vertices and edges of a graph. The…

Mathematical Physics · Physics 2020-07-22 Michał Ławniczak , Pavel Kurasov , Szymon Bauch , Małgorzata Białous , Vitalii Yunko , Leszek Sirko

We present a novel method to estimate the dominant eigenvalue and eigenvector pair of any non-negative real matrix via graph infection. The key idea in our technique lies in approximating the solution to the first-order matrix ordinary…

Numerical Analysis · Mathematics 2023-05-09 Kaiyuan Yang , Li Xia , Y. C. Tay

For a connected graph, the distance spectral radius is the largest eigenvalue of its distance matrix, and the distance energy is defined as the sum of the absolute values of the eigenvalues of its distance matrix. We establish lower and…

Combinatorics · Mathematics 2011-01-25 Bo Zhou , Aleksandar Ilic

For a Hermitian matrix $A$ of order $n$ with eigenvalues $\lambda_1(A)\ge \cdots\ge \lambda_n(A)$, define \[ \mathcal{E}_p^+(A)=\sum_{\lambda_i > 0} \lambda_i^p(A), \quad \mathcal{E}_p^-(A)=\sum_{\lambda_i<0} |\lambda_i(A)|^p,\] to be the…

Combinatorics · Mathematics 2025-06-24 Saieed Akbari , Hitesh Kumar , Bojan Mohar , Shivaramakrishna Pragada

Sombor index is a novel topological index, which was introduced by Gutman and defined for a graph $G$ as $SO(G)=\sum\limits_{uv\in E(G)}\sqrt{d_{u}^{2}+d_{v}^{2}}$, where $d_{u}=d_{G}(u)$ denotes the degree of vertex $u$ in graph $G$.…

Combinatorics · Mathematics 2022-02-21 Hechao Liu

The Sombor index of a graph $G$, introduced by Ivan Gutman, is defined as the sum of the weights $\sqrt{d_G(u)^2+d_G(v)^2}$ of all edges $uv$ of $G$, where $d_G(u)$ denotes the degree of vertex $u$ in $G$. The Sombor coindex is recently…

Combinatorics · Mathematics 2022-04-07 Zenan Du , Lihua You , Hechao Liu , Yufei Huang

Veit Elser proposed a random graph model for percolation in which physical dimension appears as a parameter. Studying this model combinatorially leads naturally to the consideration of numerical graph invariants which we call \emph{Elser…

Let $\G$ be an oriented graph of order $n$ and $\a_1,\a_2,..., \a_n$ denote all the eigenvalues of the skew-adjacency matrix of $\G.$ The skew energy $\displaystyle{\cal E}_s(\G)= \sum_{i=1}^{n} |\a_i|.$ In this paper, the oriented…

Combinatorics · Mathematics 2011-09-01 Hou Yaoping , Shen Xiaoling , Zhang Chongyan
‹ Prev 1 3 4 5 6 7 10 Next ›