A survey of automated conjectures in spectral graph theory
From MaRDI portal
Publication:962119
DOI10.1016/j.laa.2009.06.015zbMath1218.05087OpenAlexW2011612721WikidataQ122949466 ScholiaQ122949466MaRDI QIDQ962119
Pierre Hansen, Mustapha Aouchiche
Publication date: 6 April 2010
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2009.06.015
Related Items
On the extremal properties of the average eccentricity, On autographix conjecture regarding domination number and average eccentricity, Theorems on partitioned matrices revisited and their applications to graph spectra, Refutation of spectral graph theory conjectures with Monte Carlo search, On the second largest eigenvalue of the generalized distance matrix of graphs, About the type of broom trees, Graph Limits and Spectral Extremal Problems for Graphs, Proof of conjectures involving algebraic connectivity of graphs, A proof of two conjectures on the Randić index and the average eccentricity, The spectrum and the signless Laplacian spectrum of coronae, Proofs of the AutoGraphiX conjectures on the domination number, average eccentricity and proximity, On two conjectures of spectral graph theory, Further results regarding the sum of domination number and average eccentricity, The spectra and the signless Laplacian spectra of graphs with pockets, Proof of conjecture involving algebraic connectivity and average degree of graphs, On conjectures involving second largest signless Laplacian eigenvalue of graphs, The signless Laplacian spectral radius of tricyclic graphs and trees with \(k\) pendant vertices, Proof for four conjectures about the distance Laplacian and distance signless Laplacian eigenvalues of a graph, Proof of conjecture involving the second largest signless Laplacian eigenvalue and the index of graphs, Conjectures on index and algebraic connectivity of graphs, Resolution of AutoGraphiX conjectures relating the index and matching number of graphs, The \(Q\)-generating function for graphs with application, Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity, Unnamed Item, Proof of conjectures involving the largest and the smallest signless Laplacian eigenvalues of graphs
Uses Software
Cites Work
- 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
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
- Lower bounds for the clique and the chromatic numbers of a graph
- Upper bounds on algebraic connectivity via convex optimization
- Tight bounds on the algebraic connectivity of Bethe trees
- On the algebraic connectivity of graphs as a function of genus
- Old and new results on algebraic connectivity of graphs
- Walks and regular integral graphs
- Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
- Facet defining inequalities among graph invariants: The system graphedron
- A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
- On the sum of two largest eigenvalues of a symmetric matrix
- GrInvIn in a nutshell
- Transportation in graphs and the admittance spectrum
- Man-machine theorem proving in graph theory
- INGRID: A graph invariant manipulator
- On the Laplacian eigenvalues of a graph
- Eigenvalues, diameter, and mean distance in graphs
- The asymptotic behaviour of Fiedler's algebraic connectivity for random graphs
- Laplacian graph eigenvectors
- Some minimax problems for graphs
- Laplacian eigenvalues and the maximum cut problem
- Laplacian matrices of graphs: A survey
- Degree maximal graphs are Laplacian integral
- Variable neighborhood search
- A note on limit points for algebraic connectivity
- 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
- Lower bounds for the eigenvalues of Laplacian matrices
- Minimizing algebraic connectivity over connected graphs with fixed girth
- Expanding and forwarding
- A bound on the spectral radius of graphs with \(e\) edges
- On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\)
- Unicyclic graphs with maximal energy
- The limit points of Laplacian spectra of graphs
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs
- On the spectral radius of graphs with a given domination number
- On bags and bugs
- An upper bound on algebraic connectivity of graphs with many cutpoints
- Variable neighborhood search for extremal graphs 3
- A deletion-contraction algorithm for the characteristic polynomial of a multigraph
- On Complementary Graphs
- The Laplacian Spectrum of a Graph
- Parameters of connectivity in ()-linear graphs
- AutoGraphiX: a survey
- Linear combinations of graph eigenvalues
- Eigenvalue bounds for the signless laplacian
- Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
- Limit points of eigenvalues of (di)graphs
- A compilation of relations between graph invariants
- Eigenvalues of the Laplacian of a graph∗
- A compilation of relations between graph invariants—supplement I
- Eigenvectors of acyclic matrices
- Graphs characterized by the second eigenvalue
- Algebraic connectivity of weighted trees under perturbation
- Extremizing algebraic connectivity subject to graph theoretic constraints
- Maximizing Algebraic Connectivity Over Unicyclic Graphs
- On a bound on algebraic connectivity: the case of equality
- Absolute algebraic connectivity of trees
- A survey on integral graphs
- A survey of graph laplacians
- Some notes on graphs whose second largest eigenvalue is less than (√5−1)/2
- Tight bounds on the algebraic connectivity of a balanced binary tree
- Variable neighborhood search for extremal graphs.17. Further conjectures and results about the index
- Characteristic vertices of trees*
- Ordering trees by algebraic connectivity
- Variable neighborhood search: Principles and applications
- On graphs with equal algebraic and vertex connectivity
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
