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

DOI10.1142/S1793830918500714zbMath1404.05089OpenAlexW2891080887MaRDI QIDQ4644780

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 radiuscliqueTurán graphcomplete subgraph

Mathematics Subject Classification ID

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

Cites Work

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

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