Algorithmic strategies for the recognition of graphs with convex quadratic stability number
A major difficulty in the recognition of graphs with convex quadratic stability number is the existence of adverse subgraphs (an adverse subgraph is a subgraph such that the smallest eigenvalue of its adjacency matrix doesn’t change when any vertex or the neighbourhood of any vertex is deleted). It...
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | conferenceObject |
| Language: | eng |
| Published: |
2011
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10198/4777 |
| Country: | Portugal |
| Oai: | oai:bibliotecadigital.ipb.pt:10198/4777 |
| Summary: | A major difficulty in the recognition of graphs with convex quadratic stability number is the existence of adverse subgraphs (an adverse subgraph is a subgraph such that the smallest eigenvalue of its adjacency matrix doesn’t change when any vertex or the neighbourhood of any vertex is deleted). It is a challenge to find adverse graphs without convex quadratic stability number. We present the main results about graphs with convex quadratic stability number and conclusions about the existence of adverse subgraphs belonging to this family in certain classes of graphs. |
|---|