The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs

DOI10.1142/S1793830918500714zbMATH Open1404.05089OpenAlexW2891080887MaRDI QIDQ4644780FDOQ4644780

Authors: Ya-Lei Jin, Xiao-Dong Zhang 

Publication date: 9 January 2019

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830918500714

Recommendations

• The maximum spectral radius of graphs of given size with forbidden subgraph
• scientific article; zbMATH DE number 5280010
• Number of cliques in graphs with a forbidden subdivision
• Bounds on the spectral radius of general hypergraphs in terms of clique number
• On the number of cliques in graphs with a forbidden minor
• Spectral extrema of graphs with bounded clique number and matching number
• Maximal graphs and graphs with maximal spectral radius
• Spectral radius and clique partitions of graphs
• On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion

zbMATH Keywords

spectral radiuscliquecomplete subgraphTurán graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Some Inequalities for the Largest Eigenvalue of a Graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bounds on graph eigenvalues. II
• Some new results in extremal graph theory
• A spectral Erdős-Stone-Bollobás theorem
• Sharp bounds for the signless Laplacian spectral radius in terms of clique number
• Title not available (Why is that?)
• A new Turán-type theorem for cliques in graphs
• Title not available (Why is that?)
• On the maximum number of cliques in a graph
• The maximum number of cliques in dense graphs
• Cliques and the spectral radius
• Spectral extrema for graphs: the Zarankiewicz problem
• A Density Corrádi–Hajnal Theorem
• On Independent Complete Subgraphs in a Graph
• On the number of complete subgraphs and circuits contained in graphs
• Another extremal problem for Turan graphs
• The maximum number of q-cliques in a graph with no p-clique
• A generalization of a theorem of Turán
• Bounds on the number of complete subgraphs
• Title not available (Why is that?)
• A new proof of the Fisher-Ryan bounds for the number of cliques of a graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• Two extremal problems in graph theory
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• A refined Turán theorem
• Large cliques in hypergraphs with forbidden substructures
• On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion
• The maximum spectral radius of graphs of given size with forbidden subgraph
• Maximum \(K_{r+1}\)-free graphs which are not \(r\)-partite.

This page was built for publication: The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4644780)