A_-spectral characterizations of some joins
Summary: Let \(G\) be a graph with \(n\) vertices. For every real \(\alpha\in [ 0,1]\), write \(A_\alpha (G)\) for the matrix \(A_\alpha (G)=\alpha D(G)+(1-\alpha) A(G)\), where \(A(G)\) and \(D(G)\) denote the adjacency matrix and the degree matrix of \(G\), respectively. The collection of eigenvalues of \(A_\alpha (G)\) together with multiplicities are called the \(A_\alpha\)-spectrum of \(G\). A graph \(G\) is said to be determined by its \(A_\alpha\)-spectrum if all graphs having the same \(A_\alpha\)-spectrum as \(G\) are isomorphic to \(G\). In this paper, we show that some joins are determined by their \(A_\alpha\)-spectra for \(\alpha\in (0,1/2)\) or \((1/2,t1)\).
- A note on the \(A_{\alpha}\)-spectral radius of graphs
- A note on the coefficients of the \({A_\alpha}\)-characteristic polynomial of a graph
- A simple arithmetic criterion for graphs being determined by their generalized spectra
- An introduction to the theory of graph spectra
- Developments on spectral characterizations of graphs
- Graphs determined by their \(A_\alpha\)-spectra
- Merging the \(A\)- and \(Q\)-spectral theories
- On the \(\alpha\)-index of graphs with pendent paths
- On the \(\alpha\)-spectral radius of irregular uniform hypergraphs
- On the \(A_\alpha\)-spectra of graphs
- On the \(A_{\alpha}\)-characteristic polynomial of a graph
- On the \(A_{\alpha}\)-spectra of trees
- On the multiplicity of \(\alpha\) as an eigenvalue of \(A_\alpha(G)\) of graphs with pendant vertices
- On the α-spectral radius of graphs
- Per-spectral characterizations of some edge-deleted subgraphs of a complete graph
- Spectra of coronae
- Spectral characterizations of almost complete graphs
- The complement of the path is determined by its spectrum
- The spectrum and the signless Laplacian spectrum of coronae
- Which graphs are determined by their spectrum?
- Graphs determined by their \(A_\alpha\)-spectra
- On the \(A_{\alpha}\)-characteristic polynomial of a graph
- Relative discrete spectrum and joinings
- Majorization, degree sequence and \(A_\alpha\)-spectral characterization of graphs
- An arithmetic criterion for graphs being determined by their generalized \(A_\alpha \)-spectra
- The characterizing properties of (signless) Laplacian permanental polynomials of almost complete graphs
- On the generalized A_-spectral characterizations of almost -controllable graphs
- On the \(A_{\alpha }\)-spectra of some join graphs
- On the A_-spectrum of joined union of digraphs
- On Aα-spectrum of joined union of graphs and its applications to power graphs of finite groups
- Some graphs determined by their \(A_\alpha\)-spectra
This page was built for publication: \( A_\alpha\)-spectral characterizations of some joins
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2228188)
