Connected graphs of fixed order and size with maximal A_ -index: the one-dominating-vertex case
DOI10.1016/J.LAA.2023.01.001OpenAlexW4313644968MaRDI QIDQ2687249FDOQ2687249
Authors: Shuchao Li, Yuantian Yu, Qin Zhao, Bit-Shun Tam
Publication date: 1 March 2023
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2023.01.001
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
threshold graphneighborhood equivalence classmaximal graph\( A_\alpha \)-matrixmaximal \(A_\alpha \)-index problem
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Cites Work
- Towards a spectral theory of graphs based on the signless Laplacian, III
- Signless Laplacians of finite graphs
- Which graphs are determined by their spectrum?
- Enumeration of cospectral graphs.
- Eigenvalue bounds for the signless laplacian
- Some notes on graphs whose second largest eigenvalue is less than (√5−1)/2
- On the spectral radius of (0,1)-matrices
- The maximal eigenvalue of 0-1 matrices with prescribed number of ones
- Problems in algebraic combinatorics
- Maximal graphs and graphs with maximal spectral radius
- Algorithmic graph theory and perfect graphs
- Threshold graphs and related topics
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the maximal index of connected graphs
- Towards a spectral theory of graphs based on the signless Laplacian. I
- Spektren endlicher Grafen
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- On the first eigenvalue of bipartite graphs
- A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives
- Signless Laplacians and line graphs
- Degree maximal graphs are Laplacian integral
- Title not available (Why is that?)
- On the maximal index of graphs with a prescribed number of edges
- The neighborhood inclusion structure of a graph
- Largest eigenvalue of a unicyclic mixed graphs
- Theorems on partitioned matrices revisited and their applications to graph spectra
- Unoriented Laplacian maximizing graphs are degree maximal
- A note on the irregularity of graphs
- Graphs with maximal signless Laplacian spectral radius
- On the reduced signless Laplacian spectrum of a degree maximal graph
- Title not available (Why is that?)
- Some notes on the threshold graphs
- Connected graphs of fixed order and size with maximal index: some spectral bounds
- Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order
- A bound on the spectral radius of graphs with \(e\) edges
- Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
- Universal adjacency matrices with two eigenvalues
- On the largest eigenvalues of bipartite graphs which are nearly complete
- Title not available (Why is that?)
- The signless Laplacian spectral radius of graphs with a prescribed number of edges
- Merging the \(A\)- and \(Q\)-spectral theories
- Rearrangements of square matrices with non-negative elements
- Connected graphs with maximal \(Q\)-index: The one-dominating-vertex case
- Split graphs
- On the spectrum of an equitable quotient matrix and its application
- Spectral radius of bipartite graphs
- On the spectral radius of bipartite graphs which are nearly complete
- Three conjectures in extremal spectral graph theory
- The \(A_\alpha\)-spectral radius of graphs with a prescribed number of edges for \(\frac{1}{2}\leq\alpha\leq 1\)
- Maximum size of maximally irregular graphs
- Maximize the \(Q\)-index of graphs with fixed order and size
- Some bounds on the Aα-index of connected graphs with fixed order and size
Cited In (14)
- Title not available (Why is that?)
- On the \(\alpha\)-index of minimally 2-connected graphs with given order or size
- Some spectral inequalities for connected bipartite graphs with maximum \(A_\alpha\)-index
- Graphs of fixed order and size with maximal \(A_\alpha\)-index
- Connected graphs with maximal \(Q\)-index: The one-dominating-vertex case
- 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)