On bags and bugs
From MaRDI portal
Publication:2482094
Recommendations
- On the signless Laplacian index and radius of graphs
- A conjecture on the diameter and signless Laplacian index of graphs
- Sharp bounds on the spectral radii of uniform hypergraphs concerning diameter or clique number
- Majorants and minorants for the classes of graphs with fixed diameter and number of vertices
- Unified extremal results for vertex-degree-based graph invariants with given diameter
Cites work
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- scientific article; zbMATH DE number 3255492 (Why is no real title available?)
- Anticritical graphs
- On some interconnections between combinatorial optimization and extremal graph theory
- On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
- On the spectral radius of graphs with cut vertices
- Some results on the index of unicyclic graphs
- Variable neighborhood search
- Variable neighborhood search for extremal graphs 3
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
Cited in
(34)- The maximum Perron roots of digraphs with some given parameters
- On the minimum eccentric distance sum of bipartite graphs with some given parameters
- A conjecture on the diameter and signless Laplacian index of graphs
- The spectral radius of edge chromatic critical graphs
- Maximizing the spectral radius of bicyclic graphs with fixed girth
- Spectral conditions for graphs to be \(\beta\)-deficient involving minimum degree
- On spectral radii of clique and coclique extension of path and cycle
- On the \(\alpha\)-index of graphs with pendent paths
- Variable neighbourhood search: Methods and applications
- Sharp bounds on the spectral radii of uniform hypergraphs concerning diameter or clique number
- Resolution of AutoGraphiX conjectures relating the index and matching number of graphs
- On minimally 2-(edge)-connected graphs with extremal spectral radius
- A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree
- On the spectral radius of tricyclic graphs with a fixed diameter
- What’s in the Bag?
- Variable neighbourhood search: methods and applications
- Maximizing the signless Laplacian spectral radius of graphs with given diameter or cut vertices
- Asymptotic results on the spectral radius and the diameter of graphs
- On the \(\alpha\)-spectral radius of unicyclic and bicyclic graphs with a fixed diameter
- The maximum spectral radius of graphs without friendship subgraphs
- Variations on the bagdomain theme
- Maximizing the spectral radius of k-connected graphs with given diameter
- Computing the maximal signless Laplacian index among graphs of prescribed order and diameter
- The bag and the string: are they opposed?
- Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable
- scientific article; zbMATH DE number 3845184 (Why is no real title available?)
- Graphs with the minimum spectral radius for given independence number
- Spectral radius of graphs
- On the maximum spectral radius of multipartite graphs
- A survey of automated conjectures in spectral graph theory
- Further results on the reciprocal degree distance of graphs
- Some results on the distance and distance signless Laplacian spectral radius of graphs and digraphs
- Maximizing the signless Laplacian spectral radius of \(k\)-connected graphs with given diameter
- Spectral conditions for some graphical properties
This page was built for publication: On bags and bugs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482094)
