On bags and bugs
From MaRDI portal
Publication:2482094
DOI10.1016/J.DAM.2007.05.044zbMATH Open1145.05028OpenAlexW1989578968MaRDI QIDQ2482094FDOQ2482094
Authors: Pierre Hansen, Dragan Stevanović
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
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
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Distance in graphs (05C12)
Cites Work
- On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Variable neighborhood search
- On the spectral radius of graphs with cut vertices
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Title not available (Why is that?)
- Some results on the index of unicyclic graphs
- Anticritical graphs
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- Variable neighborhood search for extremal graphs 3
- On some interconnections between combinatorial optimization and extremal graph theory
Cited In (33)
- The maximum Perron roots of digraphs with some given parameters
- On the minimum eccentric distance sum of bipartite graphs with some given parameters
- The spectral radius of edge chromatic critical graphs
- A conjecture on the diameter and signless Laplacian index of graphs
- Maximizing the spectral radius of bicyclic graphs with fixed girth
- Spectral conditions for graphs to be \(\beta\)-deficient involving minimum degree
- On the \(\alpha\)-index of graphs with pendent paths
- Sharp bounds on the spectral radii of uniform hypergraphs concerning diameter or clique number
- Variable neighbourhood search: Methods and applications
- On minimally 2-(edge)-connected graphs with extremal spectral radius
- Resolution of AutoGraphiX conjectures relating the index and matching number of graphs
- A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree
- What’s in the Bag?
- 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
- Variable neighbourhood search: methods and applications
- 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
- Computing the maximal signless Laplacian index among graphs of prescribed order and diameter
- Maximizing the spectral radius of \(k\)-connected graphs with given diameter
- The bag and the string: are they opposed?
- Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable
- Title not available (Why is that?)
- Graphs with the minimum spectral radius for given independence number
- Spectral radius of graphs
- On the maximum spectral radius of multipartite graphs
- Further results on the reciprocal degree distance of graphs
- A survey of automated conjectures in spectral graph theory
- 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
Uses Software
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)