On bicyclic reflexive graphs (Q2470436)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5235159
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On bicyclic reflexive graphs |
scientific article; zbMATH DE number 5235159 |
Statements
On bicyclic reflexive graphs (English)
0 references
14 February 2008
0 references
Let \(\lambda_2\) be the second largest eigenvalue of the adjacency matrix of a graph. Graphs having \(\lambda_2\leq 2\) are called reflexive graphs. Since this property is hereditary, these graphs may be represented through sets of maximal graphs. In this paper, authors continue their previous line of study and construct maximal bicyclic reflexive graphs (called pouring) of Smith trees into graphs and by replacing free cycles with Smith trees. In addition, they provide characterizations of some rather specific classes of reflexive graphs.
0 references
second largest eigenvalue
0 references
cactus
0 references
0.8728047013282776
0 references
0.8641483187675476
0 references
0.8579967021942139
0 references
0.8510884046554565
0 references
