Resolution of AutoGraphiX conjectures relating the index and matching number of graphs

DOI10.1016/J.LAA.2010.06.015MaRDI QIDQ710882zbMATH OpenOpenAlexWikidataFDO

Authors Dragan Stevanović

Publication date 22 October 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.2010.06.015

zbMATH Keywords

spectral radiusmatching numberconjectureAutoGraphiX

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

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

(3)

• Proofs of the AutoGraphiX conjectures on the domination number, average eccentricity and proximity
• An approximation algorithm for the maximum spectral subgraph problem
• On autographix conjecture regarding domination number and average eccentricity

Describes a project that uses

Uses Software

• AutoGraphiX

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)