On bags and bugs
From MaRDI portal
Publication:2482094
DOI10.1016/j.dam.2007.05.044zbMath1145.05028OpenAlexW1989578968MaRDI QIDQ2482094
Dragan Stevanović, Pierre Hansen
Publication date: 16 April 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.05.044
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)
Related Items
Spectral Radius of Graphs, Maximizing the signless Laplacian spectral radius of \(k\)-connected graphs with given diameter, The maximum Perron roots of digraphs with some given parameters, On the \(\alpha\)-spectral radius of unicyclic and bicyclic graphs with a fixed diameter, On minimally 2-(edge)-connected graphs with extremal spectral radius, Maximizing the spectral radius of \(k\)-connected graphs with given diameter, The maximum spectral radius of graphs without friendship subgraphs, Sharp bounds on the spectral radii of uniform hypergraphs concerning diameter or clique number, Some results on the distance and distance signless Laplacian spectral radius of graphs and digraphs, Spectral conditions for graphs to be β-deficient involving minimum degree, On the \(\alpha\)-index of graphs with pendent paths, Spectral conditions for some graphical properties, A survey of automated conjectures in spectral graph theory, Variable neighbourhood search: methods and applications, Resolution of AutoGraphiX conjectures relating the index and matching number of graphs, Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable, The spectral radius of edge chromatic critical graphs, Further results on the reciprocal degree distance of graphs, On the maximum spectral radius of multipartite graphs, On the spectral radius of tricyclic graphs with a fixed diameter, Maximizing the signless Laplacian spectral radius of graphs with given diameter or cut vertices, A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree, Variable neighbourhood search: Methods and applications, Maximizing the spectral radius of bicyclic graphs with fixed girth, Asymptotic results on the spectral radius and the diameter of graphs, On the minimum eccentric distance sum of bipartite graphs with some given parameters
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Variable neighborhood search
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- On the spectral radius of graphs with cut vertices
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Some results on the index of unicyclic graphs
- Variable neighborhood search for extremal graphs 3
- On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
- Anticritical graphs
- On some interconnections between combinatorial optimization and extremal graph theory
