Zobrazeno 1 - 10
of 34
pro vyhledávání: '"F. K. Bell"'
Autor:
Slobodan K. Simić, F. K. Bell, Mustapha Aouchiche, Dragoš Cvetković, Dragan Stevanović, Pierre Hansen, Peter Rowlinson
Publikováno v:
European Journal of Operational Research. 191:661-676
We consider four conjectures related to the largest eigenvalue of (the adjacency matrix of) a graph (i.e., to the index of the graph). Three of them have been formulated after some experiments with the programming system AutoGraphiX, designed for fin
Publikováno v:
Linear Algebra and its Applications. 429:2168-2179
We continue our investigation of graphs G for which the least eigenvalue ?(G) is minimal among the connected graphs of prescribed order and size. We provide structural details of the bipartite graphs that arise, and study the behaviour of ?(G) as the
Autor:
F. K. Bell, Peter Rowlinson
Publikováno v:
Bulletin of the London Mathematical Society. 35:401-408
Star complements and associated quadratic functions are used to obtain a sharp upper bound for the order of a graph with an eigenspace of prescribed codimension. It is shown that for regular graphs the bound can be reduced by 1, and that this reduced
Autor:
Peter Rowlinson, F. K. Bell
Publikováno v:
Scopus-Elsevier
For a given positive integer t there are only finitely many graphs with an eigenvalue μ ∉{−1,0} such that the eigenspace of μ has codimension t. The graphs for which t ⩽5 are identified.
Autor:
F. K. Bell
Publikováno v:
Linear Algebra and its Applications. 296:15-25
In this paper it is shown that, for any odd integer t >3, the line graph L ( K t ) is the unique maximal graph having the cycle C t as a star complement for the eigenvalue −2. This result yields a characterization of L ( G ) for Hamiltonian graphs
Autor:
F. K. Bell, Slobodan K. Simić
Publikováno v:
Linear and Multilinear Algebra. 39:137-152
The index of a graph G is the largest eigenvalue of a (0,1)-adjacency matrix of G. Let denote the set of all graphs which can be obtained from an n-cycle by joining and additional ('central') vertex to k of the vertices of the cycle (Such graphs are
Autor:
J C, KRANTZ, F K, BELL
Publikováno v:
Federation proceedings. 6(1)
Publikováno v:
The Journal of pharmacology and experimental therapeutics. 91(2)
Publikováno v:
The Journal of pharmacology and experimental therapeutics. 89(2)
Autor:
H K, IWAMOTO, F K, BELL
Publikováno v:
The Journal of pharmacology and experimental therapeutics. 91(2)