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

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