Maximize the Q-index of graphs with fixed order and size
The signless Laplacian matrix of a graph \(G\) is defined as \(Q(G)=D(G)+A(G)\), where \(D(G)\) and \(A(G)\) are respectively the degree diagonal matrix and the adjacency matrix of \(G\). The largest eigenvalue of \(Q(G)\) is the \(Q\)-index of \(G\) and is denoted by \(\sigma (G)\). The authors raise the following two questions. (1) Which graph attains the maximum \(Q\)-index over all graphs of order \(n\) and size \(m=n+k\)? (2) Which graph attains the maximum \(Q\)-index over all \((p,q)\)-bipartite graphs with size \(m=p+q+k\)? They answer the first question for \(4\leq k\leq n- 3\) by showing that the graph \(H_{n,k}\cong K_{1}\triangledown (K_{1, k+1}\cup (n-k-3)K_{1})\) is the unique graph with the maximum \(Q\)-index over all graphs \(\mathbb{G}(n,n+k)\), with \(n\) vertices and \(n+k\) edges. The authors answer the second question for \(-p - q\leq k\leq p- q\). The maximum \(Q\)-index on connected \((p, q)\)-bipartite graphs is also determined for \(-1\leq k\leq p -2\).
- Ordering the maxima of \(L\)-index and \(Q\)-index: graphs with given size and diameter
- Maxima of \(L\)-index and \(Q\)-index: graphs with given size and diameter
- Graphs of fixed order and size with maximal \(A_\alpha\)-index
- Maxima of the \(Q\)-index: graphs with bounded clique number
- Connected graphs of fixed order and size with maximal \(Q\)-index: some spectral bounds
- Maxima of the Q-index: abstract graph properties
- Maxima of the \(Q\)-index: graphs with no \(K_{s,t}\)
- Ordering Q-indices of graphs: given size and circumference
- Maxima of the Q-index: graphs without long paths
- On maximum indexable graphs
- A bound on the spectral radius of graphs with \(e\) edges
- A note on connected bipartite graphs of fixed order and size with maximal index
- A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree
- An introduction to the theory of graph spectra
- Connected graphs of fixed order and size with maximal \(Q\)-index: some spectral bounds
- Connected graphs of fixed order and size with maximal index: some spectral bounds
- Connected graphs with maximal \(Q\)-index: The one-dominating-vertex case
- Further results on the least eigenvalue of connected graphs
- Graphs for which the least eigenvalue is minimal. II.
- Graphs with maximal number of adjacent pairs of edges
- Graphs with maximal signless Laplacian spectral radius
- scientific article; zbMATH DE number 1600999 (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?)
- Maximal graphs and graphs with maximal spectral radius
- Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order
- Maximizing the sum of the squares of the degrees of a graph
- On energy and Laplacian energy of chain graphs
- On the first eigenvalue of bipartite graphs
- On the Laplacian spectral radius of bipartite graphs with fixed order and size
- 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 spectral radius of (0,1)-matrices
- On the spectral radius of bipartite graphs which are nearly complete
- On three conjectures involving the signless Laplacian spectral radius of graphs
- Ordering (signless) Laplacian spectral radii with maximum degrees of graphs
- Sharp spectral inequalities for connected bipartite graphs with maximal Q-index
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- Signless Laplacian spectral radius and fractional matchings in graphs
- Signless Laplacians of finite graphs
- Some spectral inequalities for connected bipartite graphs with maximum \(A_\alpha\)-index
- Spectral radius of bipartite graphs
- The maximal eigenvalue of 0-1 matrices with prescribed number of ones
- The Randić index and signless Laplacian spectral radius of graphs
- The signless Laplacian spectral radius of graphs with given degree sequences
- On graphs whose signless Laplacian index does not exceed 4.5
- Maxima of \(L\)-index and \(Q\)-index: graphs with given size and diameter
- Ordering the maxima of \(L\)-index and \(Q\)-index: graphs with given size and diameter
- Connected graphs of fixed order and size with maximal \(A_\alpha \)-index: the one-dominating-vertex case
- Sharp spectral inequalities for connected bipartite graphs with maximal Q-index
- Maxima of the Q-index for outer-planar graphs
- Maxima of the Q-index for Halin graphs
- Maxima of the Q-index: abstract graph properties
- Connected graphs of fixed order and size with maximal \(Q\)-index: some spectral bounds
- A note on connected bipartite graphs of fixed order and size with maximal index
- The \(Q\)-index: degenerate graphs
- Connected graphs with maximal \(Q\)-index: The one-dominating-vertex case
- Maxima of the \(Q\)-index: graphs with no \(K_{s,t}\)
- Ordering Q-indices of graphs: given size and circumference
- Maxima of the \(Q\)-index of non-bipartite graphs: forbidden short odd cycles
- Graphs of fixed order and size with maximal \(A_\alpha\)-index
- Maxima of the \(Q\)-index of leaf-free graphs with given size
- Maxima of the \(Q\)-index for \(3 K_3\)-free graphs
- An \(A_\alpha\)-spectral version of the Bhattacharya-Friedland-Peled conjecture
- Spectral extrema of graphs with fixed size: forbidden a fan graph, a friendship graph, or a theta graph
- On the maximal \(A_{\alpha}\)-index of graphs with a prescribed number of edges
- Maxima of the Q-index: forbidden rainbow Hamilton paths, matchings and linear forests
This page was built for publication: Maximize the \(Q\)-index of graphs with fixed order and size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2237243)
