Extremal problems for the \(p\)-spectral radius of graphs

zbMath1300.05161arXiv1402.3239MaRDI QIDQ405309

Vladimir Nikiforov, Li-ying Kang

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.3239

zbMATH Keywords

extremal problemsclique numberTurán problems\(p\)-spectral radiussaturation problems

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (7)

The α-normal labelling method for computing the p-spectral radii of uniform hypergraphs ⋮ Extremal problems for the \(p\)-spectral radius of Berge hypergraphs ⋮ Spectral extremal graphs for the bowtie ⋮ Refinement on Spectral Turán’s Theorem ⋮ The extremal \(p\)-spectral radius of Berge hypergraphs ⋮ The p-spectral radius of the Laplacian matrix ⋮ The maximum spectral radius of non-bipartite graphs forbidding short odd cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sharp bounds for the signless Laplacian spectral radius in terms of clique number
• Some extremal problems for hereditary properties of graphs
• Spectral saturation: inverting the spectral Turán theorem
• Turán's theorem inverted
• Spectral bounds for the clique and independence numbers of graphs
• Analytic methods for uniform hypergraphs
• The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs
• Bounds on graph eigenvalues. II
• Joints in graphs
• A spectral condition for odd cycles in graphs
• On a valence problem in extremal graph theory
• On the structure of linear graphs
• Some new results in extremal graph theory
• Some Inequalities for the Largest Eigenvalue of a Graph
• Spectral Extremal Problems for Hypergraphs
• Maxima for Graphs and a New Proof of a Theorem of Turán
• On the number of complete subgraphs and circuits contained in graphs

This page was built for publication: Extremal problems for the \(p\)-spectral radius of graphs