On the maximal index of graphs with a prescribed number of edges

DOI10.1016/0024-3795(83)90131-3zbMath0666.05043MaRDI QIDQ1116954

Peter Rowlinson

Publication date: 1988

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(83)90131-3

zbMATH Keywords

eigenvalue; adjacency matrix; index of a graph; maximal index

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

Related Items

Estimates of the spectral radius of graphs^*, The largest eigenvalue of a graph: A survey, On a poset of trees, Connected graphs with maximal \(Q\)-index: The one-dominating-vertex case, Theorems on partitioned matrices revisited and their applications to graph spectra, Bounds on graph eigenvalues, Graphs for which the least eigenvalue is minimal. I, Unoriented Laplacian maximizing graphs are degree maximal, On graphs whose star sets are (co-)cliques, Connected graphs of fixed order and size with maximal index: some spectral bounds, On a conjecture of V. Nikiforov, On Hamiltonian graphs with maximal index, On the maximal index of connected graphs, A note on the irregularity of graphs, Bounds on eigenvalues and chromatic numbers, Maximal graphs and graphs with maximal spectral radius, Graphs with maximal signless Laplacian spectral radius, Maximizing the signless Laplacian spectral radius of graphs with given diameter or cut vertices, On the index of tricyclic Hamiltonian graphs

Cites Work

• On the spectral radius of (0,1)-matrices
• The maximal eigenvalue of 0-1 matrices with prescribed number of ones
• Bounds on the spectral radius of graphs with e edges
• A bound on the spectral radius of graphs with \(e\) edges
• Unnamed Item