Connected graphs of fixed order and size with maximal A_ -index: the one-dominating-vertex case
From MaRDI portal
Publication:2687249
Recommendations
- Graphs of fixed order and size with maximal \(A_\alpha\)-index
- Some bounds on the Aα-index of connected graphs with fixed order and size
- Some spectral inequalities for connected bipartite graphs with maximum \(A_\alpha\)-index
- Sharp bounds on the \(A_{\alpha}\)-index of graphs in terms of the independence number
- On the \(A_\alpha \)-spectral radius of graphs with given size and diameter
Cites work
- scientific article; zbMATH DE number 5177331 (Why is no real title available?)
- scientific article; zbMATH DE number 3972892 (Why is no real title available?)
- scientific article; zbMATH DE number 4079464 (Why is no real title available?)
- scientific article; zbMATH DE number 3598234 (Why is no real title available?)
- scientific article; zbMATH DE number 3632548 (Why is no real title available?)
- A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives
- A bound on the spectral radius of graphs with \(e\) edges
- A note on the irregularity of graphs
- Algorithmic graph theory and perfect graphs
- Connected graphs of fixed order and size with maximal index: some spectral bounds
- Connected graphs with maximal \(Q\)-index: The one-dominating-vertex case
- Degree maximal graphs are Laplacian integral
- Eigenvalue bounds for the signless laplacian
- Enumeration of cospectral graphs.
- Graphs with maximal signless Laplacian spectral radius
- Largest eigenvalue of a unicyclic mixed graphs
- Maximal graphs and graphs with maximal spectral radius
- Maximize the \(Q\)-index of graphs with fixed order and size
- Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order
- Maximum size of maximally irregular graphs
- Merging the \(A\)- and \(Q\)-spectral theories
- On the first eigenvalue of bipartite graphs
- On the largest eigenvalues of bipartite graphs which are nearly complete
- On the maximal index of connected graphs
- On the maximal index of graphs with a prescribed number of edges
- On the reduced signless Laplacian spectrum of a degree maximal graph
- On the spectral radius of (0,1)-matrices
- On the spectral radius of bipartite graphs which are nearly complete
- On the spectrum of an equitable quotient matrix and its application
- Problems in algebraic combinatorics
- Rearrangements of square matrices with non-negative elements
- Signless Laplacians and line graphs
- Signless Laplacians of finite graphs
- Some bounds on the Aα-index of connected graphs with fixed order and size
- Some notes on graphs whose second largest eigenvalue is less than (√5−1)/2
- Some notes on the threshold graphs
- Spectral radius of bipartite graphs
- Spektren endlicher Grafen
- Split graphs
- The \(A_\alpha\)-spectral radius of graphs with a prescribed number of edges for \(\frac{1}{2}\leq\alpha\leq 1\)
- The maximal eigenvalue of 0-1 matrices with prescribed number of ones
- The neighborhood inclusion structure of a graph
- The signless Laplacian spectral radius of graphs with a prescribed number of edges
- Theorems on partitioned matrices revisited and their applications to graph spectra
- Three conjectures in extremal spectral graph theory
- Threshold graphs and related topics
- Towards a spectral theory of graphs based on the signless Laplacian, III
- Towards a spectral theory of graphs based on the signless Laplacian. I
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- Universal adjacency matrices with two eigenvalues
- Unoriented Laplacian maximizing graphs are degree maximal
- Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
- Which graphs are determined by their spectrum?
Cited in
(14)- scientific article; zbMATH DE number 5177331 (Why is no real title available?)
- Some spectral inequalities for connected bipartite graphs with maximum \(A_\alpha\)-index
- On the \(\alpha\)-index of minimally 2-connected graphs with given order or size
- Connected graphs with maximal \(Q\)-index: The one-dominating-vertex case
- Graphs of fixed order and size with maximal \(A_\alpha\)-index
- Some bounds on the Aα-index of connected graphs with fixed order and size
- Sharp bounds on the \(A_{\alpha}\)-index of graphs in terms of the independence number
- Maxima of the \(A_\alpha\)-index of graphs with given size and domination number
- The maximal \(\alpha\)-index of trees with \(k\) pendent vertices and its computation
- \(A_{\alpha}\)-spectral extrema of graphs with given size and matching number
- On the \(A_\alpha\)-index of graphs with given order and dissociation number
- Extremal graphs for \(\alpha\)-index
- The \(\alpha \)-index of graphs without intersecting triangles/quadrangles as a minor
- An \(A_\alpha\)-spectral version of the Bhattacharya-Friedland-Peled conjecture
This page was built for publication: Connected graphs of fixed order and size with maximal \(A_\alpha \)-index: the one-dominating-vertex case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2687249)