Nordhaus-Gaddum-type relations for arithmetic-geometric spectral radius and energy
type: Item
instance of: scholarly article
title: Nordhaus-Gaddum-type relations for arithmetic-geometric spectral radius and energy
zbMATH Open document ID: 1459.05192
DOI: 10.1155/2020/5898735
author: Yajing Wang
author: Yubin Gao
published in: Mathematical Problems in Engineering
publication date: 2020-07-30T00:00:00Z
review text: Summary: Spectral graph theory plays an important role in engineering. Let \(G\) be a simple graph of order \(n\) with vertex set \(V=\left\{ v_1, v_2, \ldots, v_n\right\}\). For \(v_i\in V \), the degree of the vertex \(v_i\), denoted by \(d_i\), is the number of the vertices adjacent to \(v_i\). The arithmetic-geometric adjacency matrix \(A_{a g}\left( G\right)\) of \(G\) is defined as the \(n\times n\) matrix whose \(\left( i, j\right)\) entry is equal to \(\left( \left( d_i + d_j\right)/2 \sqrt{ d_i d_j}\right)\) if the vertices \(v_i\) and \(v_j\) are adjacent and 0 otherwise. The arithmetic-geometric spectral radius and arithmetic-geometric energy of \(G\) are the spectral radius and energy of its arithmetic-geometric adjacency matrix, respectively. In this paper, some new upper bounds on arithmetic-geometric energy are obtained. In addition, we present the Nordhaus-Gaddum-type relations for arithmetic-geometric spectral radius and arithmetic-geometric energy and characterize corresponding extremal graphs.
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 15A42
zbMATH DE Number: 7226148
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2020/5898735
OpenAlex ID: W3043001485
cites work: Q2716030
cites work: Q5159252
cites work: Q5159251
cites work: Inertia and distance energy of line graphs of unicyclic graphs
cites work: On generalized distance energy of graphs
cites work: On ABC eigenvalues and ABC energy
cites work: The minimum ABC energy of trees
cites work: On the minimal matching energies of unicyclic graphs
cites work: Energy, matching number and odd cycles of graphs
cites work: Q5005650
cites work: Q5156403
cites work: On unicyclic graphs with given number of pendent vertices and minimal energy
cites work: Bounds for graph energy in terms of vertex covering and clique numbers
cites work: Q5205526
cites work: On Complementary Graphs
cites work: A survey of Nordhaus-Gaddum type relations
cites work: Q3097395
cites work: Graph Energy
cites work: Matrix theory. Basic results and techniques
cites work: Bounds on eigenvalues and chromatic numbers
cites work: Q5661547
description: scientific article; zbMATH DE number 7226148