Results 91 to 100 of about 1,416,244 (110)

NEW CLASSES OF SEIDEL EQUIENERGETIC GRAPHS

Global and Stochastic Analysis
. In this paper, we give the complete characterization of the S - eigenvalues of the union of the join graph G 1 ∨ G 2 and the corona product G 1 ◦ G 3 when G 1 , G 2 and G 3 are regular graphs. As an application, we give some new methods to construct S -
B. R. Rakshith, B. J. Manjunatha
semanticscholar   +2 more sources

On maximum transmission energy of a graph and pair of maximum transmission equienergetic graphs

AIP Conference Proceedings, 2023
R. Rangarajan, V. D. Raghu
exaly   +2 more sources

On equienergetic signed graphs

Discrete Applied Mathematics, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shariefuddin Pirzada
exaly   +4 more sources

Equienergetic self-complementary graphs [PDF]

Czechoslovak Mathematical Journal, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
A Vijayakumar
exaly   +2 more sources

Open problems for equienergetic graphs

, 2015
The energy of a graph is equal to the sum of the absolute values of its eigenvalues. Two graphs of the same order are said to be equienergetic if their energies are equal. We point out the following two open problems for equienergetic graphs. (1) Although it is known that there are numerous pairs of equienergetic, non-cospectral trees, it is not known ...
I. Gutman
semanticscholar   +2 more sources

QUADRUPLY INTEGRAL EQUIENERGETIC GRAPHS

Far East Journal of Mathematical Sciences (FJMS), 2015
M. Pokorný, P. Híc
semanticscholar   +2 more sources

Reciprocal complementary distance equienergetic graphs

Asian-European Journal of Mathematics, 2016
The reciprocal complementary distance (RCD) matrix of a graph [Formula: see text] is defined as [Formula: see text], in which [Formula: see text] if [Formula: see text] and [Formula: see text] if [Formula: see text], where [Formula: see text] is the diameter of [Formula: see text] and [Formula: see text] is the distance between the [Formula: see text ...
H. Ramane, G. A. Gudodagi
semanticscholar   +2 more sources

Graphs equienergetic with edge-deleted subgraphs

Linear and Multilinear Algebra, 2009
The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Two graphs are equienergetic if they have the same energy. We construct infinite families of graphs equienergetic with edge-deleted subgraphs.
Chi-Kwong Li, Wasin So
exaly   +2 more sources

Hyperenergetic and Equienergetic Graphs

2012
The energy of the n-vertex complete graph K n is equal to 2(n − 1). We call an n-vertex graph Ghyperenergetic if ℰ(G) > 2(n − 1). From Theorem 5.24, we know that for almost all graphs, \(\mathcal{E}(G) > \left (\frac{1} {4} + o(1)\right ){n}^{3/2}\), which means that almost all graphs are hyperenergetic.
Yongtang Shi, Ivan Gutman, Xueliang Li
exaly   +2 more sources

Some New Results on Seidel Equienergetic 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 matrix, Common ...
S. Vaidya, K. Popat
semanticscholar   +1 more source