AN UPPER BOUND FOR THE LARGEST EIGENVALUE OF A GRAPH - EFFECT OF TYPES OF VERTICES


TURKER L.

JOURNAL OF MATHEMATICAL CHEMISTRY, cilt.9, ss.341-349, 1992 (SCI İndekslerine Giren Dergi) identifier identifier

  • Cilt numarası: 9 Konu: 4
  • Basım Tarihi: 1992
  • Doi Numarası: 10.1007/bf01166097
  • Dergi Adı: JOURNAL OF MATHEMATICAL CHEMISTRY
  • Sayfa Sayıları: ss.341-349

Özet

A novel method, based on the topology of the cardinal vertex, is described to find an upper bound for the largest eigenvalue of a graph.