Nordhaus-Gaddum-type relations for arithmetic-geometric spectral radius and energy
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.
- Arithmetic-geometric spectral radius and energy of graphs
- On the spectral radius, energy and estrada index of the arithmetic-geometric matrix of a graph
- On spectral radius and energy of arithmetic-geometric matrix of graphs
- On eigenvalues and energy of geometric-arithmetic matrix of graphs
- Arithmetic-geometric energy of specific graphs
- A survey of Nordhaus-Gaddum type relations
- Arithmetic-geometric spectral radius and energy of graphs
- Bounds for graph energy in terms of vertex covering and clique numbers
- Bounds on eigenvalues and chromatic numbers
- Energy, matching number and odd cycles of graphs
- Extremal graphs for Randić energy
- Graph energy
- Graph theory with applications
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 7410318 (Why is no real title available?)
- scientific article; zbMATH DE number 3394189 (Why is no real title available?)
- Inertia and distance energy of line graphs of unicyclic graphs
- Matrix theory. Basic results and techniques
- On ABC eigenvalues and ABC energy
- On Complementary Graphs
- On generalized distance energy of graphs
- On graph energy, maximum degree and vertex cover number on graph energy, maximum degree and vertex cover number
- On spectral radius and energy of arithmetic-geometric matrix of graphs
- On the minimal matching energies of unicyclic graphs
- On unicyclic graphs with given number of pendent vertices and minimal energy
- The minimum ABC energy of trees
- On inverse sum indeg energy of graphs
- Arithmetic-geometric matrix of graphs and its applications
- On the spectral radius, energy and estrada index of the arithmetic-geometric matrix of a graph
- On spectral radius and energy of arithmetic-geometric matrix of graphs
- Arithmetic-geometric spectral radius and energy of graphs
- On the arithmetic-geometric spectral radius of bicyclic graphs
This page was built for publication: Nordhaus-Gaddum-type relations for arithmetic-geometric spectral radius and energy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q783162)
