Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs (Q2369038): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(9 intermediate revisions by 5 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q123346079 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GRAPH / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: AutoGraphiX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: INGRID / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GRAFFITI / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: HR / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.laa.2005.10.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2062663701 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues of the Laplacian of a graph<sup>∗</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5492533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for extremal graphs. I: The AutoGraphiX system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear inequalities among graph invariants: Using <i>GraPHedron</i> to uncover optimal relationships / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3006508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Man-machine theorem proving in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5477955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian eigenvalues and the maximum cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial properties and the complexity of a max-cut approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The performance of an eigenvalue bound on the max-cut problem in some classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3318779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A compilation of relations between graph invariants—supplement I / rank
 
Normal rank
Property / cites work
 
Property / cites work: INGRID: A graph invariant manipulator / rank
 
Normal rank
Property / cites work
 
Property / cites work: On conjectures of Graffiti / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871155 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new upper bound for the Laplacian spectral radius of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5477962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5477963 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search: Principles and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: de Caen's inequality and bounds on the largest Laplacian eigenvalue of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Laplacian eigenvalues of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Laplacian graph eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5202209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expanding and forwarding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two sharp upper bounds for the Laplacian eigenvalues. / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:14, 24 June 2024

scientific article
Language Label Description Also known as
English
Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs
scientific article

    Statements

    Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs (English)
    0 references
    0 references
    0 references
    0 references
    28 April 2006
    0 references
    Conjecture
    0 references
    Automatic generation of conjectures
    0 references
    Laplacian matrix
    0 references
    Laplacian eigenvalues
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers