On the A_-index of graphs with given order and dissociation number
From MaRDI portal
Publication:6648258
Recommendations
- Maxima of the \(A_\alpha\)-index of graphs with given size and domination number
- Sharp bounds on the \(A_{\alpha}\)-index of graphs in terms of the independence number
- Graphs of fixed order and size with maximal \(A_\alpha\)-index
- Connected graphs of fixed order and size with maximal \(A_\alpha \)-index: the one-dominating-vertex case
- Some bounds on the Aα-index of connected graphs with fixed order and size
Cites Work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- scientific article; zbMATH DE number 7166393 (Why is no real title available?)
- scientific article; zbMATH DE number 2192124 (Why is no real title available?)
- A bound on the dissociation number
- A characterization of the smallest eigenvalue of a graph
- A note on the \(A_{\alpha}\)-spectral radius of graphs
- An \(A_\alpha\)-spectral Erdős-Pósa theorem
- An arithmetic criterion for graphs being determined by their generalized \(A_\alpha \)-spectra
- Bounds for the largest and the smallest \(A_\alpha\) eigenvalues of a graph in terms of vertex degrees
- Connected graphs of fixed order and size with maximal \(A_\alpha \)-index: the one-dominating-vertex case
- Independent packings in structured graphs
- Maximal and maximum dissociation sets in general and triangle-free graphs
- Maximization of the spectral radius of block graphs with a given dissociation number
- Merging the \(A\)- and \(Q\)-spectral theories
- NP-hard graph problems and boundary classes of graphs
- Node-Deletion Problems on Bipartite Graphs
- On \(A_{\alpha}\) spectral extrema of graphs forbidding even cycles
- On spectral extrema of graphs with given order and dissociation number
- On the \(A_\alpha\)-spectral radius of a graph
- On the \(A_\sigma\)-spectral radii of graphs with some given parameters
- On the \(A_{\alpha}\)-spectra of trees
- On the \(\alpha\)-index of graphs with pendent paths
- On the maximal number of maximum dissociation sets in forests with fixed order and dissociation number
- On the maximum number of maximum dissociation sets in trees with given dissociation number
- On the multiplicity of \(\alpha\) as an eigenvalue of the \(a_\alpha\) matrix of a graph in terms of the number of pendant vertices
- On the second largest \(A_{\alpha}\)-eigenvalues of graphs
- On the spectrum of an equitable quotient matrix and its application
- On the α-spectral radius of graphs
- Relating the independence number and the dissociation number
- The Nordhaus-Gaddum type inequalities of \(A_\alpha \)-matrix
- The \(A_\alpha \)-spectral radius of trees and unicyclic graphs with given degree sequence
- The \(A_\alpha\)-spectral radius for path-factors in graphs
- The complexity of dissociation set problems in graphs
- The complexity of restricted spanning tree problems
- The maximum number of maximum dissociation sets in trees
- \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs
Cited In (2)
This page was built for publication: On the \(A_\alpha\)-index of graphs with given order and dissociation number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6648258)
