New analytical lower bounds on the clique number of a graph
DOI10.1080/10556788.2016.1172578zbMath1384.05126OpenAlexW2346130554MaRDI QIDQ5268926
Vladimir Stozhkov, Eduardo L. Pasiliao, Grigory Pastukhov, Vladimir L. Boginski
Publication date: 21 June 2017
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2016.1172578
clique numberspectral graph theorypower-law graphsMotzkin-Straus formulationassortativity coefficientErdös-Rényi model
Quadratic programming (90C20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (1)
Uses Software
Cites Work
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
- Independence in connected graphs
- Interpolating between bounds on the independence number
- Lower bounds for the clique and the chromatic numbers of a graph
- Eigenvalues and forbidden subgraphs. I.
- More spectral bounds on the clique and independence numbers
- Spectral bounds for the clique and independence numbers of graphs
- Lower bounds on the stability number of graphs computed in terms of degrees
- A note on the independence number of triangle-free graphs. II
- The independence number of graphs in terms of degrees
- Independence and the Havel-Hakimi residue
- A lower bound on the independence number of a graph
- A fast algorithm for the maximum clique problem
- Exact bounds on the order of the maximum clique of a graph.
- Connected components in random graphs with given expected degree sequences
- On clique relaxation models in network analysis
- The university of Florida sparse matrix collection
- Independence, odd girth, and average degree
- Large Cliques in a Power-Law Random Graph
- Emergence of Scaling in Random Networks
- Some Inequalities for the Largest Eigenvalue of a Graph
- Spectral Radius and Degree Sequence
- Power-Law Distributions in Empirical Data
- The average distance and the independence number
- The Structure and Function of Complex Networks
- The Average Distance in a Random Graph with Given Expected Degrees
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
- Networks
- On the independence number of a graph in terms of order and size
This page was built for publication: New analytical lower bounds on the clique number of a graph
