On bicyclic reflexive graphs (Q2470436): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2007.07.057 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2066939082 / rank | |||
Normal rank | |||
Revision as of 14:24, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On bicyclic reflexive graphs |
scientific article |
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
