A survey of automated conjectures in spectral graph theory (Q962119): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q122949466, #quickstatements; #temporary_batch_1707252663060
ReferenceBot (talk | contribs)
Changed an Item
 
(11 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Mustapha Aouchiche / rank
Normal rank
 
Property / author
 
Property / author: Mustapha Aouchiche / 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: GRAPH / 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: GrInvIn / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: HR / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GraPHedron / 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.2009.06.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2011612721 / 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: Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5492533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2837831 / rank
 
Normal rank
Property / cites work
 
Property / cites work: AutoGraphiX: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424766 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for extremal graphs.17. Further conjectures and results about the index / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on integral graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5717950 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the eigenvalues of Laplacian matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A compilation of relations between graph invariants / 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: Q4129483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs characterized by the second eigenvalue / 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: A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5614192 / 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: Q5691133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3006508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3812289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3315555 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3215235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3070753 / 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: Eigenvalue bounds for the signless laplacian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5477955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for extremal graphs 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Old and new results on algebraic connectivity of graphs / 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: Q5477956 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5477957 / 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: The asymptotic behaviour of Fiedler's algebraic connectivity for random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sum of two largest eigenvalues of a symmetric matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the clique and the chromatic numbers of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3197865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5477959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremizing algebraic connectivity subject to graph theoretic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Algebraic Connectivity Over Unicyclic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing algebraic connectivity over connected graphs with fixed girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some eigenvalue properties in graphs (conjectures of Graffiti -- II) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvectors of acyclic matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Absolute algebraic connectivity of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some minimax problems for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds on algebraic connectivity via convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4729804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering trees by algebraic connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Laplacian Spectrum of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The limit points of Laplacian spectra of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4186355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5477964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search: Principles and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bags and bugs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4060995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4800103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unicyclic graphs with maximal energy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on limit points for algebraic connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on algebraic connectivity of graphs with many cutpoints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with equal algebraic and vertex connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic connectivity of weighted trees under perturbation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a bound on algebraic connectivity: the case of equality / 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: Transportation in graphs and the admittance spectrum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4189313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facet defining inequalities among graph invariants: The system graphedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characteristic vertices of trees<sup>*</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree maximal graphs are Laplacian integral / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian matrices of graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of graph laplacians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian graph eigenvectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues, diameter, and mean distance in graphs / 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: On the algebraic connectivity of graphs as a function of genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds on the algebraic connectivity of a balanced binary tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear combinations of graph eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Complementary Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameters of connectivity in ()-linear graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: GrInvIn in a nutshell / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4311468 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds on the algebraic connectivity of Bethe trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deletion-contraction algorithm for the characteristic polynomial of a multigraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some notes on graphs whose second largest eigenvalue is less than (√5−1)/2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3824447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4724663 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expanding and forwarding / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the spectral radius of graphs with \(e\) edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spectral radius of graphs with a given domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5477976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3497917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Walks and regular integral graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5474947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two sharp upper bounds for the Laplacian eigenvalues. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limit points of eigenvalues of (di)graphs / rank
 
Normal rank

Latest revision as of 15:22, 2 July 2024

scientific article
Language Label Description Also known as
English
A survey of automated conjectures in spectral graph theory
scientific article

    Statements

    A survey of automated conjectures in spectral graph theory (English)
    0 references
    0 references
    0 references
    6 April 2010
    0 references
    spectrum
    0 references
    eigenvalue
    0 references
    index
    0 references
    algebraic connectivity
    0 references
    graph
    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
    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
    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