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

DOI10.1016/j.laa.2010.06.015zbMath1211.05078OpenAlexW1977726526WikidataQ123356695 ScholiaQ123356695MaRDI QIDQ710882

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 radiusconjecturematching numberAutoGraphiX

Mathematics Subject Classification ID

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

Related Items (3)

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

Uses Software

• AutoGraphiX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectral radius of graphs with given matching number
• A survey of automated conjectures in spectral graph theory
• Bounding the largest eigenvalue of trees in terms of the largest vertex degree
• Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
• On the spectral radius of graphs with a given domination number
• On bags and bugs
• Variable neighborhood search for extremal graphs.17. Further conjectures and results about the index

This page was built for publication: Resolution of AutoGraphiX conjectures relating the index and matching number of graphs