The maximum spectral radius of graphs without friendship subgraphs (Q2209893)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The maximum spectral radius of graphs without friendship subgraphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The maximum spectral radius of graphs without friendship subgraphs |
scientific article |
Statements
The maximum spectral radius of graphs without friendship subgraphs (English)
0 references
5 November 2020
0 references
A \(k\)-friendship graph, denoted by \(F_k\), is a graph with order \(2k + 1\) and consisting of \(k\) triangles which intersect in exactly one common vertex. In this paper, the authors investigate the graphs of order \(n\) that have the maximum (adjacency) spectral radius among all the graphs which do not contain \(F_k\), for sufficiently large \(n\).
0 references
friendship graph
0 references
adjacency matrix
0 references
spectral radius
0 references
0 references
0 references
