Título: A Bound On The Spectral Radius of A Weighted Graph
Autores: Şerife BÜYÜKKÖSE
Sezer SORGUN
Fecha: 2010-03-27
Publicador: Gazi University Journal of Science
Fuente:
Tipo: Peer-reviewed Article
Tema: Weighted graph; Adjacency matrix; Spectral radius; Upper bound
Descripción: Let G be simple, connected weighted graphs, where the edge weights are positive definite matrices. In this paper, we will ive an upper bound on the spectral radius of the adjacency matrix for a graph G and characterize graphs for which the bound is attained.
Idioma: Inglés

Artículos similares:

Selective Solid-Phase Extraction of Cd(II) Using Double Imprinting Strategy por Ebru Birlik ÖZKÜTÜK,Elif ÖZALP,Gülgün İŞLER,Sibel DİLTEMİZ EMİR,Arzu ERSÖZ
The Properties of The Weak Subdifferentials. . . por Refail KASIMBEYLI,Gonca İNCEOĞLU
Influence Functions for the Moment Estimators por Ali Kemal ŞEHİRLİOĞLU
On the Dynamics of the Recursive Sequence por Saime ZENGİN,İlhan ÖZTÜRK,Fatma BOZKURT
10 
Effect of Cold on Protein, Proline, Phenolic Compounds and Chlorophyll Content of Two Pepper (Capsicum annuum L.) Varieties por Esra KOÇ,Cemil İŞLEK,A. Sülün ÜSTÜN; Ankara University, Science Faculty, Departmentof Biology, Ankara,Turkey