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

DOI10.1142/S1793830918500714MaRDI QIDQ4644780zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

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

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)