TY - JOUR
T1 - Spectral Extremal Problem on the Fish Graph
AU - Zhang, Yanting
AU - Wang, Ligong
N1 - Publisher Copyright:
© Malaysian Mathematical Sciences Society and Penerbit Universiti Sains Malaysia 2025.
PY - 2025/11
Y1 - 2025/11
N2 - Let H(4, 3) denote the 6-vertex graph obtained from a cycle of length 4 and a triangle by sharing a common vertex. The graph H(4, 3) is also known as the fish graph. A graph is said to be H(4, 3)-free if it does not contain H(4, 3) as a subgraph. In this paper, we consider the extremal problem on spectral radius for H(4, 3)-free graphs, and we determine the maximum spectral radius of an H(4, 3)-free graph with fixed number of vertices and edges, respectively. Furthermore, we characterize the corresponding extremal graphs.
AB - Let H(4, 3) denote the 6-vertex graph obtained from a cycle of length 4 and a triangle by sharing a common vertex. The graph H(4, 3) is also known as the fish graph. A graph is said to be H(4, 3)-free if it does not contain H(4, 3) as a subgraph. In this paper, we consider the extremal problem on spectral radius for H(4, 3)-free graphs, and we determine the maximum spectral radius of an H(4, 3)-free graph with fixed number of vertices and edges, respectively. Furthermore, we characterize the corresponding extremal graphs.
KW - Adjacency matrix
KW - Extremal graph
KW - Fish graph
KW - Spectral radius
UR - https://www.scopus.com/pages/publications/105019346952
U2 - 10.1007/s40840-025-01992-5
DO - 10.1007/s40840-025-01992-5
M3 - 文章
AN - SCOPUS:105019346952
SN - 0126-6705
VL - 48
JO - Bulletin of the Malaysian Mathematical Sciences Society
JF - Bulletin of the Malaysian Mathematical Sciences Society
IS - 6
M1 - 207
ER -