Resolution of AutoGraphiX conjectures relating the index and matching number of graphs
From MaRDI portal
(Redirected from Publication:710882)
Cites work
- scientific article; zbMATH DE number 5130720 (Why is no real title available?)
- scientific article; zbMATH DE number 5280010 (Why is no real title available?)
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- A survey of automated conjectures in spectral graph theory
- Bounding the largest eigenvalue of trees in terms of the largest vertex degree
- On bags and bugs
- On the spectral radius of graphs with a given domination number
- Spectral radius of graphs with given matching number
- Variable neighborhood search for extremal graphs. 20. Automated comparison of graph invariants
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Variable neighborhood search for extremal graphs. XIV: The AutoGraphiX 2 system
- Variable neighborhood search for extremal graphs.17. Further conjectures and results about the index
Cited in
(4)- Proofs of the AutoGraphiX conjectures on the domination number, average eccentricity and proximity
- An approximation algorithm for the maximum spectral subgraph problem
- Reinforcement learning for graph theory. I: Reimplementation of Wagner's approach
- On autographix conjecture regarding domination number and average eccentricity
This page was built for publication: Resolution of AutoGraphiX conjectures relating the index and matching number of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q710882)