Work

The spectral Turán problem about graphs of given size with forbidden subgraphs

Year: 2024

Type: article

Abstract: Let G be a graph of size m and ρ(G) be the spectral radius of its adjacency matrix. A graph is said to be H-free if it does not contain a subgraph isomorphic to H. Let Cl1 be the graph obtained by adding a pendent vertex to a cycle of length l. In this paper, we determine the graphs with the maximum spectral radius over C31-free graphs, and C41-free graphs with m≥9.

Source: AKCE International Journal of Graphs and Combinatorics

DOI: 10.1080/09728600.2024.2421212

Authors: Amir Rehman, S. Pirzada

Institution: University of Kashmir

Language: English

Topic: Graph theory and applications

Subfield: Geometry and Topology

Field: Mathematics

Domain: Physical Sciences

Open Access status: gold

Estimated APC paid: $1,226

Funder: Council of Scientific and Industrial Research, India