Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs

DOI10.1016/j.laa.2005.10.017zbMath1086.05049OpenAlexW2062663701WikidataQ123346079 ScholiaQ123346079MaRDI QIDQ2369038

Pierre Hansen, V. Brankov, Dragan Stevanović

Publication date: 28 April 2006

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

Full work available at URL: https://doi.org/10.1016/j.laa.2005.10.017

zbMATH Keywords

Laplacian eigenvaluesLaplacian matrixConjectureAutomatic generation of conjectures

Mathematics Subject Classification ID

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

Related Items

NEW BOUNDS AND EXTREMAL GRAPHS FOR DISTANCE SIGNLESS LAPLACIAN SPECTRAL RADIUS, Bounds for the (Laplacian) spectral radius of graphs with parameter α, A note on the upper bounds for the Laplacian spectral radius of graphs, The spectrum and the signless Laplacian spectrum of coronae, The spectra and the signless Laplacian spectra of graphs with pockets, A survey of automated conjectures in spectral graph theory, Bounds on the index of the signless Laplacian of a graph, Bounds for the Laplacian spectral radius of graphs, A few examples and counterexamples in spectral graph theory

Uses Software

• INGRID
• AutoGraphiX
• GRAFFITI
• HR
• GRAPH

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial properties and the complexity of a max-cut approximation
• The performance of an eigenvalue bound on the max-cut problem in some classes of graphs
• On conjectures of Graffiti
• Man-machine theorem proving in graph theory
• INGRID: A graph invariant manipulator
• A note on Laplacian graph eigenvalues
• On the Laplacian eigenvalues of a graph
• Laplacian eigenvalues and the maximum cut problem
• Variable neighborhood search
• A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs.
• Two sharp upper bounds for the Laplacian eigenvalues.
• Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
• A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph
• A new upper bound for the Laplacian spectral radius of graphs
• Expanding and forwarding
• Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
• Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
• Eigenvalues of the Laplacian of a graph^∗
• A compilation of relations between graph invariants—supplement I
• de Caen's inequality and bounds on the largest Laplacian eigenvalue of a graph
• Variable neighborhood search: Principles and applications