z-logo
open-access-imgOpen Access
On the seidel eigenvectors of a graph
Author(s) -
Mirko Lepović
Publication year - 2003
Publication title -
publikacija elektrotehnickog fakulteta - serija matematika
Language(s) - English
Resource type - Journals
eISSN - 2406-0852
pISSN - 0353-8893
DOI - 10.2298/petf0314004l
Subject(s) - adjacency matrix , combinatorics , eigenvalues and eigenvectors , mathematics , graph , order (exchange) , physics , quantum mechanics , finance , economics
eigenvectors of µm and µ∗m, respectively, so thatn i=1 x (m) i = √ nm and n i=1 s (m) i = √ n∗ m. In this work we show that x (m) i = k j=1 n∗ j s (j) i µ∗j +2 µm +1 √ nm and s (m) i = k j=1 √ nj x (j) i µ∗ m +2 µj +1

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom