Results 41 to 50 of about 1,416,244 (110)

Distance spectrum of Indu–Bala product of graphs

AKCE International Journal of Graphs and Combinatorics, 2016
The D-eigenvalues μ1,μ2,…,μn of a graph G of order n are the eigenvalues of its distance matrix D and form the distance spectrum or D-spectrum of G denoted by SpecD(G). Let G1 and G2 be two regular graphs. The Indu–Bala product of G1 and G2 is denoted by
G. Indulal, R. Balakrishnan
doaj   +1 more source

Inverse Sum Indeg Energy of Graphs

IEEE Access, 2019
Suppose $G$ is an $n$ -vertex simple graph with vertex set $\{v_{1}, {\dots },v_{n}\}$ and $d_{i}$ , $i=1, {\dots },n$ , is the degree of vertex $v_{i}$ in $G$ .
Sumaira Hafeez, Rashid Farooq
doaj   +1 more source

Large sets of long distance equienergetic graphs [PDF]

, 2013
Distance energy of a graph is a recent energy-type invariant, defined as the absolute deviation of the eigenvalues of the distance matrix of the graph. Two graphs of the same order are said to be distance equienergetic if they have equal distance energy,
Stevanović, Dragan
core   +1 more source

On the Complementary Equienergetic Graphs

, 2019
Energy of a simple graph $G$, denoted by $\mathcal{E}(G)$, is the sum of the absolute values of the eigenvalues of $G$. Two graphs with the same order and energy are called equienergetic graphs. A graph $G$ with the property $G\cong \overline{G}$ is called self-complementary graph, where $\overline{G}$ denotes the complement of $G$.
Ali, Akbar, Elumalai, Suresh, Mansour, Toufik, Rostami, Mohammad Ali   +3 more
openaire   +2 more sources

Equienergetic and almost-equienergetic trees [PDF]

, 2009
The energy E(G) of a graph G is equal to the sum of the absolute values of the eigenvalues of G . Two graphs Ga and Gb are said to be equienergetic if E(Ga) = E(Gb) .
Miljković, Olga, Furtula, Boris, Radenkovic, Slavko, Gutman, Ivan   +3 more
core  

Equienergetic complement graphs

, 2020
. The energy of a graph G is the sum of the absolute values of its eigenvalues. Two graphs are said to be equienergetic if their energies are equal. In this paper we show that if G is a regular graph on n vertices and of degree r ≥ 3, then E( ) ( 2 G L )
Sabeena B Halkarni, Hanumappa B Walikar, Harishchandra S Ramane, Ivan Gutman   +3 more
core  

Energy and Randić energy of special graphs

, 2022
In this paper, we determine the Randić energy of the m-splitting graph, the m-shadow graph and the m-duplicate graph of a given graph, m being an arbitrary integer.
T. K., Jahfar, Jahfar TK, A. V., Chithra
core   +1 more source

Some New Results on Seidel Equienergetic Graphs

, 2019
Published in Kyungpook Journal of Mathematics (2019)
Vaidya, Samir K., Popat, Kalpesh M.
openaire   +2 more sources

On Equienergetic Graphs and Graph Energy of Some Standard Graphs with Self loops

, 2023
Abstract Let $G_S$ be the graph of order $n$ and containing $\sigma$ self-loops. The energy $E(G_S)$ of graph $G_S$ is defined as $E(G_S)=\displaystyle\sum_{i=1}^{n}\bigg\lvert\lambda_i-\dfrac{\sigma}{n}\bigg\rvert$, where $\lambda_1, \lambda_2, \dots, \lambda_n$ be the eigenvalues of the adjacency matrix of $G_S$.
Kalpesh M. Popat, Kunal R. Shingala
openaire   +1 more source

On Topological Indices and Arithmetic–Geometric Energy of Graphs

Mathematics
Let Γ be a graph of order n with m edges, and let Aag(Γ) denote its arithmetic–geometric matrix. The eigenvalues of Aag(Γ) are referred to as the arithmetic–geometric eigenvalues of Γ.
Hilal A. Ganie, Amal Alsaluli
doaj   +1 more source