We consider two classes of graphs: (i) trees of order n and diameter d =n - 3 and (ii) unicyclic graphs of order n and girth g = n - 2. Assuming that each graph within these classes has two vertices of degree 3 at distance k, we order by the index (i.e. spectral radius) the graphs from (i) for any fixed k (1 ≤ k ≤ d - 2), and the graphs from (ii) independently of k. © 2006 Elsevier Inc. All rights reserved.

Some notes on graphs whose index is close to 2

BELARDO, FRANCESCO;LI MARZI, Enzo;
2007-01-01

Abstract

We consider two classes of graphs: (i) trees of order n and diameter d =n - 3 and (ii) unicyclic graphs of order n and girth g = n - 2. Assuming that each graph within these classes has two vertices of degree 3 at distance k, we order by the index (i.e. spectral radius) the graphs from (i) for any fixed k (1 ≤ k ≤ d - 2), and the graphs from (ii) independently of k. © 2006 Elsevier Inc. All rights reserved.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11570/1672421
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 6
  • ???jsp.display-item.citation.isi??? 4
social impact