|
|
|
|
Numerical Range of Simple Graphs and Some Bounds for their Eigenvalues
|
|
|
|
|
|
|
|
نویسنده
|
tajarrod maliheh ,sistani tahereh
|
|
منبع
|
journal of mathematical extension - 2018 - دوره : 12 - شماره : 4 - صفحه:21 -37
|
|
چکیده
|
The numerical range of a simple graph g, named f(g), is the numerical range of its adjacency matrix a(g). the main purpose of this paper is to approximate f(g). then, using this approximation, bounds for the largest and the smallest eigenvalues of g are proposed. in fact, lower bounds for the largest eigenvalues of g are presented in terms of disjoint induced subgraphs of g and the numerical range of the square of a(g).
|
|
کلیدواژه
|
Graph theory ,adjacency matrix ,eigenvalue of graphs ,numerical range
|
|
آدرس
|
islamic azad university, kerman branch, department of mathematics, iran, islamic azad university, kerman branch, department of mathematics, iran
|
|
پست الکترونیکی
|
taherehsistani@gmail.com
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|