New analytical lower bounds on the clique number of a graph (Q5268926): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Vladimir L. Boginski / rank
Normal rank
 
Property / author
 
Property / author: Vladimir L. Boginski / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SparseMatrix / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/10556788.2016.1172578 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2346130554 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emergence of Scaling in Random Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolating between bounds on the independence number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact bounds on the order of the maximum clique of a graph. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average distance and the independence number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected components in random graphs with given expected degree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Average Distance in a Random Graph with Given Expected Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power-Law Distributions in Empirical Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: The university of Florida sparse matrix collection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the clique and the chromatic numbers of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence and the Havel-Hakimi residue / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the independence number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence in connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independence number of a graph in terms of order and size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral Radius and Degree Sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large Cliques in a Power-Law Random Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence, odd girth, and average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maxima for Graphs and a New Proof of a Theorem of Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the stability number of graphs computed in terms of degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure and Function of Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Inequalities for the Largest Eigenvalue of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues and forbidden subgraphs. I. / rank
 
Normal rank
Property / cites work
 
Property / cites work: More spectral bounds on the clique and independence numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On clique relaxation models in network analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The independence number of graphs in terms of degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the independence number of triangle-free graphs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral bounds for the clique and independence numbers of graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:53, 14 July 2024

scientific article; zbMATH DE number 6734199
Language Label Description Also known as
English
New analytical lower bounds on the clique number of a graph
scientific article; zbMATH DE number 6734199

    Statements

    New analytical lower bounds on the clique number of a graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 June 2017
    0 references
    clique number
    0 references
    Motzkin-Straus formulation
    0 references
    spectral graph theory
    0 references
    assortativity coefficient
    0 references
    Erdös-Rényi model
    0 references
    power-law graphs
    0 references
    0 references

    Identifiers