The spectral Turan problem about graphs of given size with forbidden subgraphs

被引：0
作者：
Rehman, Amir [1 ]
Pirzada, S. [1 ]
机构：
[1] Univ Kashmir, Dept Math, Srinagar, India
来源：
AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS | 2025年 / 22卷 / 01期
关键词：
adjacency matrix; spectral radius; forbidden subgraph; C (l )(1)-free graph; RADIUS;
D O I：
10.1080/09728600.2024.2421212
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Let G be a graph of size m and rho(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 C-l(1) 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 C-3(1) -free graphs, and C-4(1) -free graphs with m >= 9 .
引用
收藏
页码：91 / 93
页数：3
相关论文
共 50 条
[41]   Extensions on spectral extrema of C5/C6-free graphs with given size [J].
Sun, Wanting ;
Li, Shuchao ;
Wei, Wei .
DISCRETE MATHEMATICS, 2023, 346 (12)
[42]   On spectral extrema of graphs with given order and dissociation number [J].
Huang, Jing ;
Geng, Xianya ;
Li, Shuchao ;
Zhou, Zihan .
DISCRETE APPLIED MATHEMATICS, 2024, 342 :368-380
[43]   Maximizing the spectral radius of κ-connected graphs with given diameter [J].
Huang, Peng ;
Shiu, Wai Chee ;
Sun, Pak Kiu .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2016, 488 :350-362
[44]   Graphs with given degree sequence and maximal spectral radius [J].
Biyikoglu, Tuerker ;
Leydold, Josef .
ELECTRONIC JOURNAL OF COMBINATORICS, 2008, 15 (01)
[45]   Spectral radii of friendship graphs and their connected induced subgraphs [J].
Seeger, Alberto ;
Sossa, David .
LINEAR & MULTILINEAR ALGEBRA, 2023, 71 (01) :63-87
[46]   Spectral radius of graphs with given diameter [J].
Feng, Lihua .
ARS COMBINATORIA, 2011, 98 :303-308
[47]   The Aα-Spectral Radii of Graphs with Given Connectivity [J].
Wang, Chunxiang ;
Wang, Shaohui .
MATHEMATICS, 2019, 7 (01)
[48]   On Turán’s (3,4)-problem with forbidden subgraphs [J].
A. A. Razborov .
Mathematical Notes, 2014, 95 :245-252
[49]   A generalization of a Turan's theorem about maximum clique on graphs [J].
Santiago, Douglas F. G. ;
Porto, Anderson L. P. ;
Sa, Kaio A. S. .
ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS, 2022, 10 (02) :475-483
[50]   Forbidden Subgraphs Generating Almost All Claw-Free Graphs with High Connectivity [J].
Furuya, Michitaka ;
Yokota, Maho .
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2019, E102A (09) :987-993
12345